An efficient instanton search algorithm for LP decoding of LDPC codes over the BSC

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4417-4426

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

^a MARVELL SEMICONDUCTOR INC   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c University of Arizona   (United States)

Author keywords

Binary symmetric channel (BSC); error floor; linear programming decoding; low density parity check (LDPC) codes; pseudo codewords

Indexed keywords

BINARY SYMMETRIC CHANNEL; ERROR-FLOOR; LINEAR PROGRAMMING DECODING; LOW-DENSITY PARITY-CHECK CODES; PSEUDO-CODEWORDS;

CODING ERRORS; ERROR CORRECTION; LEARNING ALGORITHMS; LINEAR PROGRAMMING;

DECODING;

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

References (32)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
3. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981. (Pubitemid 12446960)
4. J. Feldman, M.Wainwright, and D. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005. (Pubitemid 40377560)
5. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Communications, Control and Computing, 2003, pp. 1426-1435.
6. 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. (Pubitemid 34759861)
7. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel," in Proc. Int. Conf. Communications, Jun. 11-15, 2006, vol. 3, pp. 1089-1094. (Pubitemid 351575455)
8. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Dept. Elec. Eng., Univ. Linköping, Linköping, Sweden, 1996.
9. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Conf. Turbo Codes and Related Topics, Sep. 1-5, 2003, pp. 75-82.
10. 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
11. 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, Nov. 2005.
12. R. Smarandache and P. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2376-2393, Jul. 2007. (Pubitemid 47061903)
13. C. Kelley and D. Sridhara, "Pseudocodewords of Tanner graphs," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4013-4038, Nov. 2007. (Pubitemid 350141901)
14. S.-T. Xia and F.-W. Fu, "Minimum pseudoweight and minimum pseudocodewords of LDPC codes," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 480-485, Jan. 2008.
15. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, Jr, Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes, 2006 [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:cs/ 0609148
16. P. O. Vontobel, Papers on Pseudo-Codewords [Online]. Available: http://www.pseudocodewords.info
17. M. Chertkov, "Reducing the error floor," in Proc. IEEE Information Theory Workshop, Sep. 2007, pp. 230-235.
18. M. Chertkov and M. Stepanov, "An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes," IEEE Trans. Inf. Theory, vol. 54, no. 4, pp. 1514-1520, Apr. 2008. (Pubitemid 351512984)
19. M. J. Wainwright and M. I. Jordan, "Variational inference in graphical models: the view from the marginal polytope," presented at the 40th Allerton Conf. Communications, Control, and Computing, Oct. 1-3, 2003.
20. M. Chertkov and V. Chernyak, "Loop calculus helps to improve belief propagation and linear programming decodings of low-density-paritycheck codes," presented at the 44th Annu. Allerton Conf. Communications, Control and Computing, 2006.
21. S. C. Draper, J. S. Yedidia, and Y. Wang, "ML decoding via mixed-integer adaptive linear programming," in Proc. IEEE Int. Symp. Information Theory, Jun. 2007, pp. 1656-1660.
22. K. Yang, X.Wang, and J. Feldman, "Fast ML decoding of SPC product code by linear programming decoding," in Proc. IEEE Global Telecommunications Conf., Nov. 2007, pp. 1577-1581. (Pubitemid 351259291)
23. M. H. Taghavi and P. Siegel, "Adaptive methods for linear programming decoding," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5396-5410, Dec. 2008.
24. A. G. Dimakis and M. J.Wainwright, "Guessing facets: Polytope structure and improved LP decoder," in Proc. IEEE Int. Symp. Information Theory, Jul. 2006, pp. 1369-1373. (Pubitemid 351244321)
25. M. Chertkov and M. Stepanov, "Pseudo-codeword landscape," in Proc. IEEE Int. Symp. Information Theory, Jun. 2007, pp. 1546-1550.
26. D. Burshtein, "Iterative approximate linear programming decoding of LDPC codes with linear complexity," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1498-1502.
27. S. K. Chilappagari, M. Chertkov, M. G. Stepanov, and B. Vasic, "Instanton- based techniques for analysis and reduction of error floors of LDPC codes," IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 855-865, Aug. 2009.
28. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," presented at the ISCTA, 2001.
29. 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 Codes, Systems and Graphical Models. New York: Springer, 2001, pp. 101-112.
30. D. Sridhara, Personal Communication, Aug. 2008.
31. 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, Aug. 2008.
32. D. J. C. Mackay, Encyclopedia of Sparse Graph Codes [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html