Space–Time Coding Techniques With Bit-Interleaved Coded Modulations for MIMO Block-Fading Channels

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading multiple-input multiple-output (MIMO) channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upper bound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders, called dispersive nucleo algebraic (DNA) precoders are proposed. The proposed precoders have good performance with respect to the state of the art and exist for any number of transmit antennas and any time dimension. With turbo codes, they exhibit a frame error rate which does not increase with frame length.

[1]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

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

[3]  Gregory Poltyrev,et al.  The error probability of M-ary PSK block coded modulation schemes , 1996, IEEE Trans. Commun..

[4]  Raymond Knopp,et al.  New space-time coding techniques with bit interleaved coded modulations , 2004 .

[5]  Joseph J. Boutros,et al.  Information theoretical versus algebraic constructions of linear unitary precoders for non-ergodic multiple antenna channels , 2005 .

[6]  Norman C. Beaulieu,et al.  Linear threaded algebraic space-time constellations , 2003, IEEE Trans. Inf. Theory.

[7]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

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

[9]  Loïc Brunel,et al.  Soft-input soft-output lattice sphere decoder for linear channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[11]  Joseph J. Boutros,et al.  Turbo code design in the block fading channel , 2004 .

[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]  Hesham El Gamal,et al.  On the design of algebraic space-time codes for MIMO block-fading channels , 2003, IEEE Trans. Inf. Theory.

[14]  Karim Abed-Meraim,et al.  Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.

[15]  Harry Leib,et al.  Coded Diversity on Block-Fading Channels , 1999, IEEE Trans. Inf. Theory.

[16]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[17]  Joseph J. Boutros,et al.  Turbo Coding and Decoding for Multiple Antenna Channels , 2003 .

[18]  Pranav Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2005, IEEE Transactions on Information Theory.

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

[20]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[21]  A. J. Grant,et al.  Low complexity list detection for high-rate multiple-antenna channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[23]  A. Chkeif,et al.  Sphere decoding of space-time codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[24]  Nicolas Gresset,et al.  New space-time coding techniques with bit interleaved coded modulations , 2004 .

[25]  Andrew C. Singer,et al.  Minimum mean squared error equalization using a priori information , 2002, IEEE Trans. Signal Process..

[26]  Catherine Lamy.  Communications a grande efficacité spectrale sur le canal a evanouissements , 2000 .

[27]  Raymond Knopp,et al.  Maximizing diversity on block-fading channels , 1997, Proceedings of ICC'97 - International Conference on Communications.

[28]  Norman C. Beaulieu,et al.  Systematic construction of full diversity algebraic constellations , 2003, IEEE Trans. Inf. Theory.

[29]  G. Caire,et al.  Turbo-like Codes are Good for the Block-Fading Channel , 2004 .

[30]  D. Kraus,et al.  Calculation of moments of complex Wishart and complex inverse Wishart distributed matrices , 2000 .

[31]  Joachim Hagenauer,et al.  Iterative detection of MIMO transmission using a list-sequential (LISS) detector , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[32]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[33]  Giuseppe Caire,et al.  Impact of signal constellation expansion on the achievable diversity of pragmatic bit-interleaved space-time codes , 2006, IEEE Transactions on Wireless Communications.

[34]  P. Dayal,et al.  An optimal two transmit antenna space-time code and its stacked extensions , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[35]  Giorgio Taricco,et al.  Exact pairwise error probability of space-time codes , 2002, IEEE Trans. Inf. Theory.

[36]  Bin Dong,et al.  A new class of soft MIMO demodulation algorithms , 2003, IEEE Trans. Signal Process..

[37]  Loïc Brunel,et al.  Multidimensional mappings for iteratively decoded BICM on multiple-antenna channels , 2005, IEEE Transactions on Information Theory.

[38]  Dariush Divsalar,et al.  Turbo codes for PCS applications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[39]  Hesham El Gamal,et al.  A new approach to layered space-Time coding and signal processing , 2001, IEEE Trans. Inf. Theory.

[40]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[41]  Loïc Brunel,et al.  Optimal linear precoding for BICM over MIMO channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[43]  John G. Proakis,et al.  Digital Communications , 1983 .

[44]  Steven W. McLaughlin,et al.  On performance limits of space-time codes: a sphere-packing bound approach , 2003, IEEE Trans. Inf. Theory.

[45]  Giuseppe Caire,et al.  Turbo-like codes for the block-fading channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[46]  Raymond Knopp,et al.  On coding for block fading channels , 2000, IEEE Trans. Inf. Theory.

[47]  Venugopal V. Veeravalli,et al.  On performance analysis for signaling on correlated fading channels , 2001, IEEE Trans. Commun..