Finding all small error-prone substructures in LDPC codes

IEEE Transactions on Information Theory

Volumn 55, Issue 5, 2009, Pages 1976-1999

  Wang, Chih Chun ^a   Kulkarni, Sanjeev R ^b   Poor, H Vincent ^b  

^a PURDUE UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

Branch and bound; Error floors; Exhaustive search; Low density parity check (LDPC) codes; Stopping distance; Stopping trapping sets; Support trees

Indexed keywords

BRANCH-AND-BOUND; ERROR FLOORS; EXHAUSTIVE SEARCH; LOW-DENSITY PARITY-CHECK (LDPC) CODES; STOPPING DISTANCE; STOPPING/TRAPPING SETS;

CODES (SYMBOLS); CONTROL THEORY; FLOORS; ITERATIVE DECODING; LEARNING ALGORITHMS; MONTE CARLO METHODS;

SET THEORY;

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

References (54)

1. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Network of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
2. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963, vol. 21, Research Monograph Series.
3. D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
4. C. Di, D. Proietti, E. Telatar, T. Richardson, 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.
5. J. Zhang and A. Orlitsky, "Finite length analysis of large- and irregular-left degree ldpc codes over erasure channels," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 3.
6. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2003.
7. D. MacKay and M. Postol, "Weakness of Margulis and Ramanujan-Margulis low-density parity check codes," Electron. Notes Theor. Comp. Sci. vol. 74, 2003.
8. P. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," IEEE Trans. Inf. Theory, preprint-arXiv:cS.IT/0512078, to be published.
9. M. Stepanov and M. Chertkov, "Instanton analysis of low-density parity-check codes in the error-floor regime," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 552-556.
10. J. Yedidia, E. Sudderth, and J.-P. Bouchaud, Projection Algebra Analysis of Error Correcting Codes Mitsubishi Electric Res. Labs., Cambridge, MA, Tech. Rep. TR2001-35, 2001.
11. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
12. C.-C. Wang, S. R. Kulkarni, and H. V. Poor, "Density evolution for asymmetric memoryless channels," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4216-4236, Dec. 2005.
13. A. Amraoui, R. Urbanke, A. Montanari, and T. Richardson, "Further results on finite-length scaling for iteratively decoded LDPC ensembles," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 103.
14. C. Cole, S. Wilson, E. Hall, and T. Giallorenzi, "Analysis and design of moderate length regular LDPC codes with low error floors," in Proc. 40th Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2006.
15. R. Holzlöhner, A. Mahadevan, C. Menyuk, J. Morris, and J. Zweck, "Evaluation of the very low BER of FEC codes using dual adaptive importance sampling," IEEE Commun. Lett., vol. 9, no. 2, pp. 163-165, Feb. 2005.
16. M. Stepanov, V. Chernyak, M. Chertkov, and B. Vasić, "Diagnosis of weaknesses in modern error correction codes: A physics approach," Phys. Rev. Lett., vol. 95, Nov. 2005.
17. T. Richardson, M. 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.
18. C.-C. Wang, "Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble," in Proc. 2006 IEEE Information Theory Workshop, Chengdu, China, Oct. 2006, pp. 194-198.
19. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
20. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory vol. 48, no. 4, pp. 887-908, Apr. 2002.
21. S. Litsyn and V. Shevelev, "Distance distributions in ensembles of irregular low-density parity-check codes," IEEE Trans. Inf. Theory vol. 49, no. 12, pp. 3140-3159, Dec. 2003.
22. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 922-932, Mar. 2006.
23. K. Krishnan and P. Shankar, "On the complexity of finding stopping distance in Tanner graphs," in Proc. 40th Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2006.
24. E. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inf. Theory vol. IT-24, no. 2, pp. 384-386, Mar. 1978.
25. I. Dumer, D. Micciancio, and M. Sudan, "Hardness of approximating the minimum distance of a linear code," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 22-37, Jan. 2003.
26. A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1757-1766, Nov. 1997.
27. K. Abdel-Ghaffar and J. Weber, "Stopping set enumerators of full-rank parity-check matrices of Hamming codes," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1544-1548.
28. M. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2000.
29. R. Tanner, D. Sridhara, A. Sridharan, T. Fuja, and D. Costello Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
30. R. Smarandache, A. Pusane, P. Vontobel, and D. Costello, Jr., "Pseudo-codewords in LDPC convolutional codes," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1364-1368.
31. S. Ländner and O. Milenkovic, "Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes," in Proc. 2005 Int. Conf. Wireless Networks, Communications, and Mobile Computing, Maui, HI, Jun. 2005, pp. 630-635.
32. C. Berrou and S. Vaton, "Computing the minimum distance of linear codes by the error impulse method," in Proc. IEEE Int. Symp. Information Theory, Luasanne, Switzerland, Jun./Jul. 2002, p. 5.
33. X. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE Int. Conf. Communications, Paris, France, 2004, pp. 767-771.
34. Y. Mao and A. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE Int'. Conf. Communications, Helsinki, Finland, Jun. 2001, pp. 41-44.
35. X. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
36. T. Tian, C. Jones, J. Villasenor, and R. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, Aug. 2004.
37. A. Ramamoorthy and R. Wesel, "Construction of short block length irregular low-density parity-check codes," in Proc. IEEE Int. Conf. Communications, Jun. 2004, vol. 1, pp. 410-414.
38. E. Sharon and S. Litsyn, "A method for constructing LDPC codes with low error floor," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 2569-2573.
39. J. Tillich and G. Zémor, "On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1549-1553.
40. P. Vontobel and R. Koetter, "Lower bounds on the minimum pseudoweight of linear codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 70.
41. X. Wu, X. You, and C. Zhao, "An efficient girth-locating algorithm for quasi-cyclic LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 817-820.
42. T. Halford, K. Chugg, and A. Grant, "Which codes have 4-cycle-free Tanner graphs," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 871-875.
43. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 2173-2181, Sep. 1999.
44. S. Hoory, "The size of bipartite graphs with a given girth," J. Comb. Theory. Ser. B, vol. 86, no. 2, pp. 215-220, 2002.
45. M. Twitto, I. Sason, and S. Shamai (Shitz), "Tightened upper bounds on the ML decoding error probability of binary linear codes," IEEE Trans. Inf. Theory, to be published.
46. S. Shamai (Shitz) and I. Sason, "Variations on the Gallager bounds, connections, and applications," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3029-3051, Dec. 2002.
47. J. Rosenthal and P. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 38th Annu. Allerton Conf. Communications, Control and Computing, Monticello, IL, 2000, pp. 248-257.
48. G. A. Margulis, "Explict constructions of graphs without short cycles," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
49. F. Kschischang, B. 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.
50. M. Sipser, Introduction to the Theory of Computation, 2nd ed. Boston, MA: Course Technology, 2005.
51. J. Yedidia and J.-P. Bouchaud, Renormalization Group Approach to Error-Correcting Codes Mitsubishi Electric Research Laboratories, Cambridge, MA, Tech. Rep. TR2001-19, 2001.
52. D. Divsalar, "Ensemble weight enumerators for protograph LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1554-1558.
53. [Online]. Available: http://lthcwww.epfl.ch/research/
54. [Online]. Available: http://magma.maths.usyd.edu.au/