On Fast-Decodable Space-Time Block Codes

In this paper, we focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a unified analysis of two families of 2 x 2 STBCs that were recently proposed. In particular, we describe a reduced- complexity sphere decoding algorithm suitable for QAM signal constellations. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.

[1]  Olav Tirkkonen,et al.  Multi-Antenna Transceiver Techniques for 3G and Beyond: Hottinen/Multi-antenna , 2003 .

[2]  Frédérique E. Oggier,et al.  Cyclic Division Algebras: A Tool for Space-Time Coding , 2007, Found. Trends Commun. Inf. Theory.

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

[4]  Olav Tirkkonen,et al.  Combined information and performance optimization of linear MIMO modulations , 2002, Proceedings IEEE International Symposium on Information Theory,.

[5]  H. Sari,et al.  A Full-Rate Full-Diversity 2×2 Space-Time Code for Mobile WiMAX Systems , 2007, 2007 IEEE International Conference on Signal Processing and Communications.

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

[7]  Yi Hong,et al.  A Space-Time Block Coded Multiuser MIMO Downlink Transmission Scheme , 2006, 2006 IEEE International Symposium on Information Theory.

[8]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[9]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

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

[11]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[12]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[13]  Ari Hottinen,et al.  Precoder designs for high rate spacetime block codes , 2004 .

[14]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[15]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[16]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[18]  Ari Hottinen,et al.  Closed-loop modes for two high-rate linear space-time block codes , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[19]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[20]  J. Belfiore,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[21]  Michael P. Fitz,et al.  Reducing The Detection Complexity By Using 2×2 Multi-Strata Space-Time Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[22]  Michael P. Fitz,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1999, IEEE Trans. Commun..

[23]  Erik G. Larsson,et al.  Space-Time Block Coding for Wireless Communications , 2003 .

[24]  Mohammad Gharavi-Alkhansari,et al.  A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.