Instanton-based techniques for analysis and reduction of error floors of LDPC codes

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 6, 2009, Pages 855-865

  Chilappagari, Shashi Kiran ^a   Chertkov, Michael ^b   Stepanov, Mikhail G ^c   Vasic, Bane ^a  

^a University of Arizona   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c University of Arizona   (United States)

Author keywords

Error Floor; Instantons; Iterative Decoding; Linear Programming Decoding; Low density parity check codes; Pseudo Codewords; Trapping Sets

Indexed keywords

ERROR FLOOR; INSTANTONS; LINEAR PROGRAMMING DECODING; LOW-DENSITY PARITY-CHECK CODES; PSEUDO-CODEWORDS; TRAPPING SETS;

CODING ERRORS; ERROR CORRECTION; FLOORS; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE DECODING; OPTIMIZATION; TURBO CODES; WHITE NOISE;

LINEAR PROGRAMMING;

EID: 84055222321     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090804     Document Type: Article

References (48)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices, " IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, 1999.
3. J. Pearl, Probablisitic Reasoning in Intelligent Systems. San Francisco, CA: Kaufmann, 1988.
4. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes, " Problems of Information Transmission, vol. 11, no. 1, pp. 18-28, 1976.
5. M. Sipser and D. Spielman, "Expander codes, " IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 1710-1722, 1996.
6. J. Feldman, M. Wainwright, and D. Karger, "Using linear programming to decode binary linear codes, " IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 954-972, March 2005.
7. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, March 2008. [Online]. Available: http://lthcwww.epfl.ch/mct/index.php
8. T. J. Richardson and R. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, 2001.
9. T. J. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, 2001.
10. L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A, " IEEE Trans. Inform. Theory, vol. 50, pp. 2010-2021, 2004.
11. D. Burshtein and G. Miller, "Expander graph arguments for messagepassing algorithms, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 782-790, 2001.
12. D. Burshtein, "On the error correction of regular LDPC codes using the flipping algorithm, , " IEEE Trans. Inform. Theory, vol. 54, no. 2, pp. 517-530, Feb. 2008.
13. J. Feldman and C. Stein, "LP decoding achieves capacity, " in SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2005, pp. 460-469.
14. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright, "LP decoding corrects a constant fraction of errors, " IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 82-89, 2007.
15. C. Daskalakis, A. G. Dimakis, R. M. Karp, and M. J. Wainwright, "Probabilistic analysis of linear programming decoding." IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3565-3578, August 2008.
16. T. J. Richardson, "Error floors of LDPC codes, " in Proc. 41st Annual Allerton Conf. on Communications, Control and Computing, 2003, pp. 1426-1435. [Online]. Available: http://www.hpl.hp.com/personal/Pascal\Vontobel/ pseudocodewords/papers
17. 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. Inform. Theory, vol. 48, pp. 1570-1579, 2002.
18. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles, " IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 929-953, March 2005.
19. N. Wiberg, "Codes and decoding on general graphs, " Ph.D. dissertation, Univ. Link̈oping, Sweden, Dept. Elec. Eng., 1996.
20. B. Frey, R. Koetter, and A. Vardy, "Signal-space characterization of iterative decoding, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 766-781, Feb. 2001.
21. G. D. Forney, R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles, " in In Codes, systems and graphical models. Springer, 2001, pp. 101-112.
22. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite length analysis of message-passing iterative decoding of LDPC codes, " 2005. [Online]. Available: http://arxiv.org/abs/cs.IT/0512078
23. P. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding, " in Proc. of the Int. Symp. on Inform. Theory and its Appl., Oct. 10-13 2004, pp. 991-996.
24. D. J. C. MacKay and M. J. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes, " in Proceedings of MFCSIT2002, Galway, ser. Electronic Notes in Theoretical Computer Science, vol. 74. Elsevier, 2003. [Online]. Available: http://www.inference.phy.cam.ac.uk/ mackay/abstracts/margulis.html
25. M. G. Stepanov, V. Chernyak, M. Chertkov, and B. Vasic, "Diagnosis of weaknesses in modern error correction codes: A physics approach, " Phys. Rev. Lett., vol. 95, p. 228701, 2005.
26. C. Kelley and D. Sridhara, "Pseudocodewords of Tanner graphs, " IEEE Trans. Inform. Theory, vol. 53, no. 11, pp. 4013-4038, Nov. 2007.
27. S.-T. Xia and F.-W. Fu, "Minimum pseudoweight and minimum pseudocodewords of LDPC codes, " IEEE Trans. Inform. Theory, vol. 54, no. 1, pp. 480-485, Jan. 2008.
28. R. Smarandache and P. O. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes, " IEEE Trans. Inform. Theory, vol. 53, no. 7, pp. 2376-2393, 2007.
29. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, "Pseudo-codewords in LDPC convolutional codes, " in Proc. Int. Symp. on Inform. Theory, July 9-14 2006, pp. 1364-1368.
30. O. Milenkovic, E. Soljanin, and P. Whiting, "Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles, " IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 39-55, 2007.
31. C.-C. Wang, S. R. Kulkarni, and H. V. Poor, "Exhaustion of error-prone patterns in LDPC codes, " to appear in IEEE Trans. Inform. Theory. [Online]. Available: http://arxiv.org/abs/cs/0609046
32. V. Chernyak, M. Chertkov, M. Stepanov, and B. Vasic, "Instanton method of post-error-correction analytical evaluation, " in Proc. IEEE Inform. Theory Workshop, 2004, pp. 220-224.
33. M. Chertkov and M. Stepanov, "An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes, " IEEE Trans. Inform. Theory, vol. 54, no. 4, pp. 1514-1520, April 2008.
34. S. K. Chilappagari, M. Chertkov, and B. Vasic, "Provably efficient instanton search algorithm for LP decoding of LDPC codes over the BSC, " 2008, submitted to IEEE Trans. Inform. Theory. [Online]. Available: http://arxiv.org/abs/0808.2515
35. P. O. Vontobel, "Papers on pseudo-codewords." [Online]. Available: http://www.hpl.hp.com/personal/Pascal\Vontobel/pseudocodewords/papers
36. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of groupstructured LDPC codes, " in Proc. ISCTA, 2001. [Online]. Available: http://www.soe.ucsc.edu/-tanner/isctaGrpStrLDPC.pdf
37. R. M. Tanner, "A recursive approach to low complexity codes, " IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, 1981.
38. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes, " in Proc. of the 3rd Intern. Conf. on Turbo Codes and Related Topics, Sept. 1-5 2003, pp. 75-82.
39. M. J. Wainwright and M. I. Jordan, "Variational inference in graphical models: the view from the marginal polytope, " in Proc. 40th Allerton Conf. on Communications, Control, and Computing, 2003. [Online]. Available: http://www.hpl.hp.com/personal/Pascal\Vontobel/pseudocodewords/papers
40. M. Stepanov and M. Chertkov, "Instanton analysis of low-density-paritycheck codes in the error-floor regime, " in Proc. of the Int. Symp. on Inform. Theory, July 9-14 2006, pp. 9-14.
41. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel, " in Proc. Int. Conf. on Communications, vol. 3, 2006, pp. 1089-1094.
42. M. Ivkovic, S. K. Chilappagari, and B. Vasic, "Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers, " IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3763-3768, 2008. [Online]. Available: http://dx.doi.org/10.1109/TIT.2008.926319
43. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C : The Art of Scientific Computing. Cambridge University Press, October 1992.
44. S. K. Chilappagari, D. V. Nguyen, B. Vasic, and M. W. Marcellin, "On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes, " May 2008. [Online]. Available: http://arxiv.org/abs/0805. 2427
45. -"Error correction capability of column-weight-three LDPC codes: Part II, " Jul 2008. [Online]. Available: http://arxiv.org/abs/0807.3582
46. S. K. Chilappagari and B. Vasic, "Error correction capability of column-weight-three LDPC codes, " IEEE Trans. Inform. Theory, vol. 55, no. 5, pp. 2055-2061, May 2009.
47. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs, " IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 386-398, 2005.
48. S. K. Chilappagari, A. R. Krishnan, and B. Vasic, "LDPC codes which can correct three errors under iterative decoding, " in Proc. IEEE Inform. on Theory Workshop, May 2008, pp. 406-410.