LP decoding of regular LDPC codes in memoryless channels

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 887-897

  Halabi, Nissim ^a   Even, Guy ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Additive white Gaussian noise (AWGN) channel; channel coding; error bounds; factor graphs; linear programming decoding; low density parity check (LDPC) codes; memoryless binary input output symmetric (MBIOS) channel; thresholds

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; ERROR BOUNDS; FACTOR GRAPHS; LINEAR PROGRAMMING DECODING; LOW-DENSITY PARITY-CHECK CODES; MEMORYLESS BINARY-INPUT OUTPUT-SYMMETRIC CHANNELS; THRESHOLDS;

ADDITIVE NOISE; CHANNEL CODING; CODING ERRORS; COMMUNICATION SYSTEMS; DECODING; DIGITAL COMMUNICATION SYSTEMS; ERROR ANALYSIS; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); GRAPHIC METHODS; MESSAGE PASSING; OPTIMIZATION; PROBABILITY; QUADRATURE AMPLITUDE MODULATION; WHITE NOISE;

FREQUENCY SELECTIVE FADING;

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

References (21)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
3. D. J. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity check codes," Electron. Lett., vol. 33, pp. 457-458, Mar. 1997.
4. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. on Commun. (ICC'93), Geneva, Switzerland, 1993, vol. 2, pp. 1064-1070.
5. T. 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)
6. J. Feldman, "Decoding Error-Correcting Codes Via Linear Programming," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
7. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005.
8. P. O.Vontobel and R.Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," [Online]. Available: http://arxiv.org/abs/cs.IT/0512078
9. J. Feldman and D. R. Karger, "Decoding turbo-like codes via linear programming," J. Comput. Syst. Sci., vol. 68, no. 4, pp. 733-752, Jun. 2004.
10. N. Halabi and G. Even, "Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 265-280, Jan. 2005.
11. R. Koetter and P. O. Vontobel, "On the block error probability of LP decoding of LDPC codes," in Proc. Inaugur. Workshop of the Center for Inf. Theory and its Appl., La Jolla, CA, Feb. 2006.
12. J. Feldman and C. Stein, "LP decoding achieves capacity," in Proc. Symp. Discrete Algorithms (SODA'05), Vancouver, Canada, Jan. 2005, pp. 460-469.
13. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J.Wainwright, "LP decoding corrects a constant fraction of errors," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 82-89, Jan. 2007.
14. C. Daskalakis, A. Dimakis, R. Karp, and M.Wainwright, "Probabilistic analysis of linear programming decoding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3565-3578, Aug. 2008.
15. S. Arora, C. Daskalakis, and D. Steurer, "Message passing algorithms and improved LP decoding," in Proc. 41st Ann. ACM Symp. Theory of Comput. (STOC'09), Bethesda, MD, USA, May 31-Jun. 02 2009, pp. 3-12.
16. J. Feldman, R.Koetter, and P. O.Vontobel, "The benefit of thresholding in LP decoding of LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT'05), Adelaide, Australia, Sep. 2005, pp. 307-311, 49.
17. X.Wei and A. Akansu, "Density evolution for low-density parity-check codes under Max-Log-MAP decoding," Electron. Lett., vol. 37, no. 18, pp. 1125-1126, Aug. 2001.
18. P. Vontobel, "A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization," in Proc. Inf. Theory and Appl. Workshop, Univ. Calif. San Diego, La Jolla, Jan. 31-Feb. 5 2010.
19. W. Xu and B. Hassibi, "On the complexity of exact maximum-likelihood decoding for asymptotically good low density parity check codes: A new perspective," in Proc. IEEE Inf. Theory Workshop, Tahoe City, CA, Sep. 26, 2007, pp. 150-155.
20. T. Richardson and R. Urbanke, Modern Coding Theory. New York: Cambridge Univ. Press, 2008.
21. S.-Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.