On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

Haiquan Wang; Dong Wang; Xiang Gen Xia

doi:10.1109/isit.2005.1523525

On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

Haiquan Wang
, Dong Wang
, Xiang Gen Xia

University of Delaware

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

20 Citations (Scopus)

Abstract

In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

Original language	English
Title of host publication	Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1168-1172
Number of pages	5
ISBN (Print)	0780391519, 9780780391512
DOIs	https://doi.org/10.1109/isit.2005.1523525
Publication status	Published - 2005
Externally published	Yes
Event	2005 IEEE International Symposium on Information Theory, ISIT 2005 - Adelaide, Australia Duration: 4 Sept 2005 → 9 Sept 2005

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Electronic)	2157-8117

Conference

Conference	2005 IEEE International Symposium on Information Theory, ISIT 2005
Country/Territory	Australia
City	Adelaide
Period	4/09/05 → 9/09/05

Access to Document

10.1109/isit.2005.1523525

Cite this

Wang, H., Wang, D., & Xia, X. G. (2005). On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity. In Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005 (pp. 1168-1172). (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/isit.2005.1523525

@inproceedings{eed0b6b37baf4c4dafa624b7a2c9e6f0,

title = "On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity",

abstract = "In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.",

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

year = "2005",

doi = "10.1109/isit.2005.1523525",

language = "English",

isbn = "0780391519",

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

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

pages = "1168--1172",

booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005",

address = "United States",

}

Wang, H, Wang, D & Xia, XG 2005, On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity. in Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005. IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1168-1172, 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, Australia, 4/09/05. https://doi.org/10.1109/isit.2005.1523525

On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity. / Wang, Haiquan; Wang, Dong; Xia, Xiang Gen.
Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005. Institute of Electrical and Electronics Engineers Inc., 2005. p. 1168-1172 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

AU - Wang, Haiquan

AU - Wang, Dong

AU - Xia, Xiang Gen

PY - 2005

Y1 - 2005

N2 - In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

AB - In this paper, we first present a necessary and sufficient condition on linear transformations for an QOSTBC to possess the minimum ML decoding complexity, i.e., real symbol pair-wise decoding. We then present optimal linear transformations of information symbols for quasi-orthogonal space-time block codes (QOSTBC) with minimum ML decoding complexity, The optimality is in the sense that the diversity product (or product distance) is maximized when the mean transmission power is fixed.

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

U2 - 10.1109/isit.2005.1523525

DO - 10.1109/isit.2005.1523525

M3 - Conference contribution

AN - SCOPUS:105029346354

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1168

EP - 1172

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 4 September 2005 through 9 September 2005

ER -

Wang H, Wang D, Xia XG. On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity. In Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005. Institute of Electrical and Electronics Engineers Inc. 2005. p. 1168-1172. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/isit.2005.1523525

On Optimal Quasi-Orthogonal Space-Time Block Codes with Minimum Decoding Complexity

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this