Upper bounds of rates of space-time block codes from complex orthogonal designs

Haiquan Wang*, Xiang Gen Xia

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

12 Citations (Scopus)

Abstract

Some upper bounds on the rates of complex orthogonal space-time (COST) block codes were derived. A construction of rate 1/2 COST block codes for phase shift keying (PSK) and QAM symbols was provided using real orthogonal space-time block codes of rate 1. To maintain the fast maximum likelihood (ML) decoding and the full diversity of a space-time block code, the orthonormality that the norms of all column vectors were the same can be relaxed to general orthogonality.

Original languageEnglish
Pages (from-to)303
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: 30 Jun 20025 Jul 2002

Fingerprint

Dive into the research topics of 'Upper bounds of rates of space-time block codes from complex orthogonal designs'. Together they form a unique fingerprint.

Cite this