New space-time coding techniques with bit interleaved coded modulations

[1]  Joseph J. Boutros,et al.  Bit-interleaved coded modulations for multiple-input multiple-output channels , 2000, 2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536).

[2]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[3]  H. Herzberg,et al.  Techniques of bounding the probability of decoding error for block coded modulation structures , 1994, IEEE Trans. Inf. Theory.

[4]  Gerhard Bauch,et al.  Optimized symbol mappings for bit-interleaved coded modulation with iterative decoding , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[5]  James A. Ritcey,et al.  Design, analysis, and performance evaluation for BICM-ID with square QAM constellations in Rayleigh fading channels , 2001, IEEE J. Sel. Areas Commun..

[6]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7]  Xiaodong Li,et al.  Bit-interleaved coded modulation with iterative decoding , 1997, IEEE Communications Letters.

[8]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[9]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

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

[11]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[13]  Hideki Imai,et al.  A new multilevel coding method using error-correcting codes , 1977, IEEE Trans. Inf. Theory.

[14]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[15]  Claude Berrou,et al.  The ten-year-old turbo codes are entering into service , 2003, IEEE Commun. Mag..

[16]  Hesham El Gamal,et al.  On the design of algebraic space-time codes for MIMO block-fading channels , 2003, IEEE Trans. Inf. Theory.

[17]  Claus-Peter Schnorr,et al.  Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.

[18]  Americo Brajal,et al.  Orthogonal multicarrier techniques applied to direct sequence spread spectrum CDMA systems , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

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

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

[21]  Nicolas Gresset,et al.  Soft output detection for multiple antennas : Accelerated sphere decoding and shifted list enumeration , 2003 .

[22]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[23]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[24]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[25]  Rüdiger L. Urbanke,et al.  The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..

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

[27]  Loïc Brunel.  Optimum and sub-optimum multiuser detection based on sphere decoding for multi-carrier code division multiple access systems , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[28]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[29]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[31]  Jean-Paul M. G. Linnartz,et al.  Multi-Carrier Cdma In Indoor Wireless Radio Networks , 1994 .

[32]  Ran Gozali,et al.  Space-Time Codes for High Data Rate Wireless Communications , 2002 .

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

[34]  R. Koetter,et al.  Turbo equalization , 2004, IEEE Signal Processing Magazine.

[35]  Ephraim Zehavi,et al.  8-PSK trellis codes for a Rayleigh channel , 1992, IEEE Trans. Commun..

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

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

[38]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[39]  Loïc Brunel,et al.  Lattice decoding for joint detection in direct-sequence CDMA systems , 2003, IEEE Trans. Inf. Theory.

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

[41]  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).

[42]  Loïc Brunel,et al.  Optimum multiuser detection for MC-CDMA systems using sphere decoding , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

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

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

[45]  J. Pierce,et al.  Multiple Diversity with Nonindependent Fading , 1960, Proceedings of the IRE.

[46]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[47]  G. Battail.  Théorie de l'information , 1982, Électronique.

[48]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[49]  S. Brink.  Convergence of iterative decoding , 1999 .

[50]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[51]  F. Oggier,et al.  Perfect Space Time Block Codes , 2006 .

[52]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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

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

[55]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[56]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[57]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

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

[59]  Krishna R. Pattipati,et al.  Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

[61]  K. Fazel,et al.  On the Performance of Convolutionally-Coded CDMA/OFDM for Mobile Communication System , 1993 .

[62]  Hans-Andrea Loeliger,et al.  Some Remarks on Factor Graphs , 2003 .

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

[64]  Andrej Stefanov,et al.  Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: system model, decoding approaches, and practical considerations , 2001, IEEE J. Sel. Areas Commun..

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

[66]  Frank R. Kschischang.  Codes defined on graphs , 2003, IEEE Commun. Mag..

[67]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

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

[69]  Allen Gersho,et al.  Pseudo-Gray coding , 1990, IEEE Trans. Commun..

[70]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

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

[72]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[73]  G. Ungerboeck,et al.  Trellis-coded modulation with redundant signal sets Part II: State of the art , 1987, IEEE Communications Magazine.

[74]  N. Gresset,et al.  Linear precoding under iterative processing for multiple antenna channels , 2004, First International Symposium on Control, Communications and Signal Processing, 2004..

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

[76]  Dariush Divsalar,et al.  Introduction to Trellis-Coded Modulation With Applications , 1991 .

[77]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

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

[79]  Erik G. Ström,et al.  On the optimality of the binary reflected Gray code , 2004, IEEE Transactions on Information Theory.

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

[81]  Luc Vandendorpe,et al.  Turbo-equalization for multilevel modulation: an efficient low-complexity scheme , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[82]  James A. Ritcey,et al.  Tight BER bounds for iteratively decoded bit-interleaved space-time coded modulation , 2004, IEEE Communications Letters.

[83]  Robert F. H. Fischer,et al.  Multilevel codes: Theoretical concepts and practical design rules , 1999, IEEE Trans. Inf. Theory.

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

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