2010 IEEE Wireless Communication and Networking Conference 2010
DOI: 10.1109/wcnc.2010.5506470
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

Abstract: Abstract-This paper is on the design and performance analysis of practical distributed space-time codes for wireless relay networks with multiple antennas terminals. The amplify-andforward scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. We propose distributed generalized quasi-orthogonal space-time codes which are distributed among the source antennas and relays, and valid for any number of relays. Assuming M -PSK and M -QAM signals, we deri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
13
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 13 publications
0
13
0
Order By: Relevance
“…Distributed space-time coding was generalized to networks with multipleantenna nodes in [53], and the design of practical DSTCs with multiple antennas terminals has also been recently considered in [48,54,55]. In [54,55], which due to the space limitation we have not included them in this thesis, the orthogonal and quasi-orthogonal space-time design is used for A&F based wireless relay networks with multiple-antenna nodes.…”
Section: Distributed Space-time Codingmentioning
confidence: 99%
“…Distributed space-time coding was generalized to networks with multipleantenna nodes in [53], and the design of practical DSTCs with multiple antennas terminals has also been recently considered in [48,54,55]. In [54,55], which due to the space limitation we have not included them in this thesis, the orthogonal and quasi-orthogonal space-time design is used for A&F based wireless relay networks with multiple-antenna nodes.…”
Section: Distributed Space-time Codingmentioning
confidence: 99%
“…denotes the received symbol vector without noise which is determined by substituting each column of S into (11). It is worth to mention that the optimization algorithm contains a discrete part which refers to the ML detection and a continuous part which refers to the optimization of the code matrix, and the detection and the optimization can be implemented separately as they do not depend on each other.…”
Section: ML Detection and Ls Code Matrix Estimation Algorithmmentioning
confidence: 99%
“…An adaptive distributed-Alamouti (DAlamouti) space-time block code (STBC) design is proposed in [8] for non-regenerative dual-hop wireless systems which achieves the minimum outage probability. DSTC schemes for the AF protocol are discussed in [9]- [11]. In [9], the GABBA STC scheme is extended to a distributed MIMO network with full-diversity and full-rate, while an optimal algorithm for the design of the DSTC scheme to achieve the optimal diversity and multiplexing tradeoff is derived in [10].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, the work on delay-tolerant DSTC has focused on encoding using a fixed scheme, such as TAST codes in [10], which are difficult to implement with other DSTC schemes. In the literature, the DSTC designs in [17][18][19][20][21][22][23] can achieve full diversity order and high coding gains but are vulnerable to delays. In order to improve the existing DSTC schemes and overcome the delay issues, a general delay-tolerant encoding design and algorithm is needed.…”
Section: Introductionmentioning
confidence: 99%