Sciweavers

CORR
2006
Springer

Quasi-Orthogonal STBC With Minimum Decoding Complexity

14 years 14 days ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper, we analyze some of its essential code parameter and code property. Specifically, we derive its maximum achievable code rate expression for any number of transmit antennas. We also derive the closedform 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.
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
Comments (0)