Time-varying space-only codes

Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and no channel state information at the transmitter, optimal space-time codes (STCs) achieving both gains (full rate and full diversity) are well known. However, the complexity of maximum likelihood decoding increases exponentially with the number of space and time dimensions of the STC. Despite praiseworthy efforts to reduce the decoding complexity, optimal STCs are not used in practice in the case of more than two transmit antennas because of complexity reasons. It is generally accepted that reducing the dimension of the STC leads to a reduced diversity order. We show that this is not true for coded communication, assuming the presence of an outer error-correcting code with any coding rate. We propose a new class of full-rate full-diversity STCs; more specifically, time-varying space-only codes. This new class is referred to as EMI codes. Full diversity is proven in terms of outage probability, for the case where the number of receive antennas is larger than or equal to the number of transmit antennas, and is numerically verified in terms of outage and word error probability using LDPC codes.

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

[2]  Giuseppe Caire,et al.  Multidimensional Coded Modulation in Block-Fading Channels , 2008, IEEE Trans. Inf. Theory.

[3]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[4]  Claude Oestges,et al.  MIMO Wireless Communications: From Real-World Propagation to Space-Time Code Design , 2007 .

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

[6]  Jean-Claude Belfiore,et al.  Distributed rotation recovers spatial diversity , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Giuseppe Caire,et al.  Coded modulation in the block-fading channel: coding theorems and code construction , 2006, IEEE Transactions on Information Theory.

[8]  B.S. Rajan,et al.  Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $\times$ 2 and 4 $\times$ 2 MIMO Systems , 2008, IEEE Journal of Selected Topics in Signal Processing.

[9]  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..

[10]  Marc Moeneclaey,et al.  Time-Varying Space-Only Codes for Coded MIMO , 2012, ArXiv.

[11]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[12]  Emanuele Viterbo,et al.  Signal Space Diversity: A Power- and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel , 1998, IEEE Trans. Inf. Theory.

[13]  Loïc Brunel,et al.  Space–Time Coding Techniques With Bit-Interleaved Coded Modulations for MIMO Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[14]  Marc Moeneclaey,et al.  Time-varying space-only code: A new paradigm for coded MIMO communication , 2012, 2012 5th International Symposium on Communications, Control and Signal Processing.

[15]  Joseph Jean Boutros,et al.  The Aladdin-Pythagoras space-time code , 2009, 2009 IEEE International Symposium on Information Theory.

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

[17]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

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

[19]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.