Single-block coded modulation for MINO systems

This paper introduces a new class of space-time codes that achieve coding gain without a trellis or any form of inter-block dependency. The construction of the new codes starts from an existing (parent) space-time block code (STBC). Then by increasing the constellation size followed by expurgation of the expanded codebook, a better code is obtained at the original transmission rate. This method can be applied to a wide variety of space-time block codes, including orthogonal codes and quasi-orthogonal codes. A multi-stage design algorithm is presented, and for orthogonal parent codes, an efficient decoding algorithm is developed, and its decoding complexity is analyzed. Despite altering the regular structure of the orthogonal code, the decoding complexity is only affected by a constant factor.

[1]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[2]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[3]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes through constellation rotation , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Il-Min Kim,et al.  Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes , 2006, IEEE Transactions on Communications.

[5]  Aria Nosratinia,et al.  Relaxed threaded space-time codes , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[6]  Byeong Gi Lee,et al.  New bounds of pairwise error probability for space-time codes in Rayleigh fading channels , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[7]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[8]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[9]  Michael P. Fitz,et al.  Improved high-rate space-time codes via orthogonality and set partitioning , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[10]  Hamid Jafarkhani,et al.  Super-orthogonal space-time trellis codes , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[11]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[12]  Minh-Tuan Le,et al.  Very-Low-Complexity Maximum-Likelihood Decoders for Four-Transmit-Antenna Quasi-Orthogonal Space-Time Code , 2005, IEICE Trans. Commun..

[13]  Hamid Jafarkhani A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..