The universality of LDPC codes on wireless channels

Root and Variaya proved the existence of codes that can communicate reliably over any linear Gaussian channel for which the mutual information exceeds the information rate of the code. In this paper we demonstrate that properly designed low-density parity-check (LDPC) codes are such codes and that their performance lies in close proximity to the Root and Variaya capacity for the linear Gaussian vector channels (a.k.a. space-time channels). We also demonstrate the robustness of the codes on the partial-band jamming channel and in fast Rayleigh fading.

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

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

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

[4]  Wayne E. Stark,et al.  Turbo codes for coherent FH-SS with partial band interference , 1997, MILCOM 97 MILCOM 97 Proceedings.

[5]  Richard D. Wesel,et al.  Universal space-time trellis codes , 2003, IEEE Trans. Inf. Theory.

[6]  A. van Zelst,et al.  Turbo-BLAST and its performance , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[7]  Michael B. Pursley,et al.  Decoding strategies for turbo product codes in frequency-hop wireless communications , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[8]  Andrea M. Tonello,et al.  Space-time bit-interleaved coded modulation with an iterative decoding strategy , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[9]  P. Varaiya,et al.  Capacity of Classes of Gaussian Channels , 1968 .

[10]  B. M. Fulk.  MATH , 1992 .

[11]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[13]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[14]  Richard D. Wesel,et al.  Trellis codes for periodic erasures , 2000, IEEE Trans. Commun..

[15]  Richard D. Wesel,et al.  Robustness of LDPC codes on periodic fading channels , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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