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
N1 - Publisher Copyright:
© 2005 IEEE.All rights reserved.
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 -