Quasi-orthogonal STBC with minimum decoding complexity: Further results

Chau Yuen*, Yong Liang Guan, Tjeng Thiang Tjhung

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

30 Citations (Scopus)

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 parameter and code property. 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.

Original languageEnglish
Pages (from-to)483-488
Number of pages6
JournalIEEE Wireless Communications and Networking Conference, WCNC
Volume1
Publication statusPublished - 2005
Externally publishedYes
Event2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off - New Orleans, LA, United States
Duration: Mar 13 2005Mar 17 2005

ASJC Scopus Subject Areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Quasi-orthogonal STBC with minimum decoding complexity: Further results'. Together they form a unique fingerprint.

Cite this