Finite-length scaling for iteratively decoded LDPC ensembles

IEEE Transactions on Information Theory

Volumn 55, Issue 2, 2009, Pages 473-498

  Amraoui, Abdelaziz ^a   Montanari, Andrea ^b,c   Richardson, Tom ^d   Urbanke, Rüdinger ^a  

^a EPFL   (Switzerland)

^b STANFORD UNIVERSITY   (United States)

^c LABORATOIRE DE PHYSIQUE STATISTIQUE   (France)

^d QUALCOMM INC   (United States)

Author keywords

Binary erasure channel; Density evolution; Error probability curve; Finite length analysis; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

CODES (SYMBOLS); PROBABILITY; SCALING LAWS;

BINARY ERASURE CHANNEL; DENSITY EVOLUTION; ERROR PROBABILITY CURVE; FINITE-LENGTH ANALYSIS; LOW DENSITY PARITY-CHECK (LDPC) CODES;

ITERATIVE DECODING;

EID: 61349119398     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2009580     Document Type: Article

References (32)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions Washington, DC: Nat. Bur. Stand., 1964, vol. 55.
2. A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke, "Finite-length scaling for iteratively decoded LDPC ensembles," in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
3. A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke, "Finite-length scaling and finite-length shift for low-density parity-check codes," in Proc. 42nd Annu. Allerton Conf. Communication, Control and Computing Monticello, IL, 2004.
4. A. Amraoui, A. Montanari, and R. Urbanke, "How to find good finite-length codes: From art towards science," Europ. Trans. Telecomm., vol. 18, pp. 491-508, 2007.
5. I. Andriyanova, "Finite-length scaling of parallel turbo codes on the BEC," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1893-1897.
6. I. Andriyanova, "Finite-length scaling of repeat-accumulate codes on the BEC," in Proc. 2008 IEEE Int. Zürich Seminar on Communications, Zürich, Switzerland, Mar. 2008, pp. 64-67.
7. B. Bollobás, Random Graphs. San Diego, CA: Academic, 1985.
8. V. E. Britikov, "The asymptotic number of forests from unrooted trees," Math. Notes, vol. 43, pp. 387-394, 1988.
9. A. Dembo and A. Montanari, "Finite size scaling for the core of large random hypergraphs," Ann. Appl. Probab., 2008.
10. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
11. C. Di, T. Richardson, and R. Urbanke, "Weight distribution of iterative coding systems: How deviant can you be?," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 50.
12. J. Ezri, A. Montanari, and R. Urbanke, "A generalization of the finite-length scaling approach beyond the BEC," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1011-1015.
13. J. Ezri, A. Montanari, S. Oh, and R. Urbanke, "The slope scaling parameter for general channels, decoders and ensembles," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1443-1447.
14. M. E. Fisher, M. S. Green, Ed., Critical Phenomena (Proc. Enrico Fermi School, Varenna, Italy, 1970, course no. 51). New York: Academic, 1971, International School of Physics Enrico Fermi, Course LI.
15. P. Groeneboom, "Brownian motion with a parabolic drift and airy functions," Probab. Theory Related Fields, vol. 81, pp. 79-109, 1989.
16. V. F. Kolchin, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 1999.
17. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
18. J. Lee and R. Blahut, "Bit error rate estimate of finite length turbo codes," in Proc. Int. Conf. Communications, Anchorage, AK, May 2003, vol. 4, pp. 2728-2732.
19. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
20. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th Annu. ACM Symp. Theory of Computing, 1997, pp. 150-159.
21. C. McDiarmid, Concentration, in Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habid, C. McDiarmid, R. Ramirez-Alfonsin, and B. Reed, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 16, Algorithms and Combinatorics, pp. 195-248.
22. A. Montanari, "The glassy phase of Gallager codes," Europ. Phys. J. B, vol. 23, pp. 121-136, 2001.
23. H. Pfister, "Finite-length analysis of a capacity achieving ensemble for the binary erasure channel," in Proc. IEEE Inform. Theory Workshop, Rotorua, New Zealand, Sep. 2005, 5 pp..
24. V. Privman, "Finite-size scaling theory," in Finite Size Scaling and Numerical Simulation of Statistical Systems, V. Privman, Ed., Singapore: World Scientific, 1990, pp. 1-98.
25. T. Richardson, A. Shokrollahi, and R. Urbanke, "Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 1.
26. T. Richardson and R. Urbanke, "Finite-Length Density Evolution and the Distribution of the Number of Iterations for the Binary Erasure Channel," in preparation.
27. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2008.
28. J.-P. Tillich and J. Zémor, "Discrete isoperimetric inequalities and the probability of a decoding error," Combin., Probab. Comput., vol. 9, pp. 465-479, 2000.
29. S. R. S. Varadhan, Lecure Notes on Stochastic Processes 2000 [Online]. Available: http://www.math.nyu.edu/faculty/varadhan/
30. H. S. Wilf, Generatingfunctionology, 2nd ed. San Diego, CA: Academic, 1994.
31. G. Zémor and G. Cohen, "The threshold probability of a code," IEEE Trans. Inf. Theory, vol. 41, no. 2, pp. 469-477, Mar. 1995.
32. J. Zhang and A. Orlitsky, "Finite-length analysis of LDPC codes with large left degrees," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 2002, p. 3.