Irregular turbo codes in block-fading channels

We study irregular binary turbo codes over nonergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo codes that exhibit a small decoding threshold over the ergodic Gaussian-noise channel perform very close to the outage probability on block-fading channels, from both density evolution and finite-length perspectives.

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

[2]  Hui Jin,et al.  Block Error Iterative Decoding Capacity for LDPC Codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[3]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

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

[5]  Dariush Divsalar,et al.  Soft-input soft-output modules for the construction and distributed iterative decoding of code networks , 1998, Eur. Trans. Telecommun..

[6]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[7]  Ezio Biglieri,et al.  Coding for Wireless Channels , 2005 .

[8]  A. Guillen,et al.  Coding in the Block-Erasure Channel , 2006, IEEE Transactions on Information Theory.

[9]  Sergio VerdÂ,et al.  Fading Channels: InformationTheoretic and Communications Aspects , 2000 .

[10]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[11]  Joseph J. Boutros,et al.  Turbo code at 0.03 dB from capacity limit , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

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

[14]  Joseph J. Boutros,et al.  Turbo code design for block fading channels , 2004 .

[15]  Joseph J. Boutros,et al.  Analysis of coding on non-ergodic block-fading channels , 2005 .

[16]  Harry Leib,et al.  Evaluating the performance of convolutional codes over block 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]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

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

[20]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[21]  Hans-Andrea Loeliger.  New turbo-like codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[22]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[23]  Valentin Savin,et al.  Capacity-Approaching Irregular Turbo Codes for the Binary Erasure Channel , 2010, IEEE Transactions on Communications.

[24]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).