Title :
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
Author :
Wang, Haiquan ; Wang, Dong ; Xia, Xiang-Gen
Author_Institution :
Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE
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
Keywords :
block codes; maximum likelihood decoding; space-time codes; ML decoding complexity; minimum decoding complexity; quasi-orthogonal space-time block codes; symbol pair-wise decoding; AWGN; Block codes; Constellation diagram; Euclidean distance; Fading; Lattices; Maximum likelihood decoding; Quadrature amplitude modulation; Receiving antennas; Sufficient conditions;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523525
