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

Haiquan Wang; Xiang Gen Xia

doi:10.1109/ISIT.2002.1023575

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

Haiquan Wang^*
, Xiang Gen Xia

^*Corresponding author for this work

University of Delaware

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	303
Number of pages	1
ISBN (Print)	0780375017
DOIs	https://doi.org/10.1109/ISIT.2002.1023575
Publication status	Published - 2002
Externally published	Yes
Event	2002 IEEE International Symposium on Information Theory, ISIT 2002 - Lausanne, Switzerland Duration: 30 Jun 2002 → 5 Jul 2002

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2002 IEEE International Symposium on Information Theory, ISIT 2002
Country/Territory	Switzerland
City	Lausanne
Period	30/06/02 → 5/07/02

Access to Document

10.1109/ISIT.2002.1023575

Cite this

Wang, H., & Xia, X. G. (2002). Upper bounds of rates of space-time block codes from complex orthogonal designs. In Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002 (pp. 303). (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2002.1023575

@inproceedings{0a43a9c4ec904f5ea700b95ab3a765ce,

title = "Upper bounds of rates of space-time block codes from complex orthogonal designs",

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.",

author = "Haiquan Wang and Xia, \{Xiang Gen\}",

year = "2002",

doi = "10.1109/ISIT.2002.1023575",

language = "English",

isbn = "0780375017",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "303",

booktitle = "Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002",

address = "United States",

note = "2002 IEEE International Symposium on Information Theory, ISIT 2002 ; Conference date: 30-06-2002 Through 05-07-2002",

}

Wang, H & Xia, XG 2002, Upper bounds of rates of space-time block codes from complex orthogonal designs. in Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002. IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 303, 2002 IEEE International Symposium on Information Theory, ISIT 2002, Lausanne, Switzerland, 30/06/02. https://doi.org/10.1109/ISIT.2002.1023575

Upper bounds of rates of space-time block codes from complex orthogonal designs. / Wang, Haiquan; Xia, Xiang Gen.
Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 303 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Wang, Haiquan

AU - Xia, Xiang Gen

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0036350203

U2 - 10.1109/ISIT.2002.1023575

DO - 10.1109/ISIT.2002.1023575

M3 - Conference contribution

AN - SCOPUS:0036350203

SN - 0780375017

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 303

BT - Proceedings - 2002 IEEE International Symposium on Information Theory, ISIT 2002

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2002 IEEE International Symposium on Information Theory, ISIT 2002

Y2 - 30 June 2002 through 5 July 2002

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this