On the Practicality of Low-Density Parity-Check Codes

Recent advances in coding theory have produced two classes of codes, turbo codes and low-density parity-check (LDPC) codes, which approach the Shannon limit of channel capacity while admitting efficient implementations of message encoding and decoding in software. Theoretic results about the latter have been shown to apply to the former, hence we examine the evolution of LDPC codes from their origin in Gallager’s 1963 thesis to their current incarnation as tornado codes developed by Luby, Mitzenmacher, Shokrollahi, and Spielman. After considering several analytic approaches to quantifying their performance, we discuss the practicality of LDPC codes, particularly those designed for the erasure channel, when applied to a number of current problems in networking.

[1]  Michael Mitzenmacher,et al.  A Note on Low Density Parity Check Codes for Erasures and Errors , 1998 .

[2]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[5]  David Mackay.  Turbo codes are low-density parity-check codes , 1998 .

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

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

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

[9]  D. Spielman,et al.  Expander codes , 1996 .

[10]  Paul C. van Oorschot,et al.  An Introduction to Error Correcting Codes with Applications , 1989 .

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

[12]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

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

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

[15]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[16]  David Burshtein,et al.  Expander graph arguments for message-passing algorithms , 2001, IEEE Trans. Inf. Theory.