DocumentCode
3096542
Title
Quasi-orthogonal STBC with minimum decoding complexity: further results
Author
Yuen, Chau ; Guan, Yong Liang ; Tjhung, Tjeng Thiang
Author_Institution
Nanyang Technol. Univ., Singapore, Singapore
Volume
1
fYear
2005
fDate
13-17 March 2005
Firstpage
483
Abstract
A new class of quasi-orthogonal space-time block code (QO-STBC) namely minimum-decoding-complexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameters and code properties. Specifically we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closed form expression of its diversity product and use it to obtain the optimum constellation rotation in order to achieve optimum decoding performance. Other performance benefits of MDC-QOSTBC, such as low decoding complexity, good coding gain and power distribution property, flexibility in supporting any constellation and number of transmit antennas, are also presented and discussed.
Keywords
MIMO systems; block codes; computational complexity; decoding; diversity reception; optimisation; space-time codes; transmitting antennas; MDC-QOSTBC; MIMO systems; closed form expression; coding gain; decoding complexity; diversity product; maximum achievable code rate expression; minimum-decoding-complexity QO-STBC; optimum constellation rotation; optimum decoding performance; power distribution property; quasi-orthogonal space-time block code; transmit antennas; Block codes; Chromium; Maximum likelihood decoding; Performance gain; Phase shift keying; Power distribution; Quadrature amplitude modulation; Receiving antennas; Space technology; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference, 2005 IEEE
ISSN
1525-3511
Print_ISBN
0-7803-8966-2
Type
conf
DOI
10.1109/WCNC.2005.1424548
Filename
1424548
Link To Document