Iterative approximate linear programming decoding of LDPC codes with linear complexity

IEEE Transactions on Information Theory

Volumn 55, Issue 11, 2009, Pages 4835-4859

  Burshtein, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Iterative decoding; Linear programming decoding; Low density parity check (LDPC) codes

Indexed keywords

APPROXIMATE LINEAR PROGRAMMING; APPROXIMATE SOLUTION; BELIEF PROPAGATION; BLOCK LENGTHS; CODEWORD; CONVERGENCE RATES; ERRONEOUS BITS; ITERATIVE ALGORITHM; LDPC CODES; LINEAR COMPLEXITY; LINEAR PROGRAMMING DECODING; LOW COMPLEXITY; LOW-DENSITY PARITY-CHECK (LDPC) CODES; LOW-DENSITY PARITY-CHECK CODES; LP DECODING; MIN-SUM; OBJECTIVE FUNCTION VALUES; SCHEDULING SCHEMES; STANDARD METHOD;

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; ERROR CORRECTION; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION;

ITERATIVE DECODING;

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

References (40)

1. 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.
2. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. IEEE Int. Symp. Information Theory and Its Applications, ISITA 2004, Parma, Italy, Oct. 2004, pp. 991-996.
3. G. D. Forney Jr., 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 (Minneapolis, MN, 1999), IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, vol. 123, pp. 101-112.
4. P. O.Vontobel and R.Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," IEEE TSans. Inf. Theory [Online]. Available: ArXiv:cs/0512078v1, submitted for publication
5. S. C. Draper, J. S. Yedidia, and Y. Wang, "ML decoding via mixed-integer adaptive linear programming," in Proc. IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, Jun. 2007, pp. 1656-1660.
6. M. H. Taghavi and P. H. Siegel, "Adaptive methods for linear programming decoding," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5396-5410, Dec. 2008.
7. A. G. Dimakis, A. A. Gohari, and M. J.Wainwright, "Guessing facets: Polytope structure and improved LP decoding," [Online]. Available: arXiv:cS.IT/0709.3915, submitted for publication
8. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
9. M. G. Luby,M.Mitzenmacher,M.A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
10. 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.
11. J. Feldman, D. R. Karger, and M. J. Wainwright, "Linear programming-based decoding of turbo-like codes and its relation to iterative approaches," in Proc. 40th Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2002, pp. 467-477.
12. K. Yang, J. Feldman, and X. Wang, "Nonlinear programming approaches to decoding low-density parity-check codes," IEEE J. Sel. Areas Commun. vol. 24, no. 8, pp. 1603-1613, Aug. 2006.
13. P. O. Vontobel and R. Koetter, "Towards low-complexity linear-programming decoding," in Proc. 4th Int. Symp. Turbo Codes and Related Topics, Munich, Germany, Apr. 2006, pp. 1603-1613, [Snline]. Available: Arxiv:cs/0602088v1.
14. P. O. Vontobel and R. Koetter, "On low-complexity linear-programming decoding of LDPC codes," Europ. Trans. Telecommun., vol. 18, no. 5, pp. 509-517, Aug. 2007.
15. K. Yang, X. Wang, and J. Feldman, "A new linear programming approach to decoding linear block codes," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1061-1072, Mar. 2008.
16. P. O. Vontobel, "Interior-point algorithms for linear-programming decoding," in Proc. 2008 Information Theory and Applications Workshop, Univ. Calif. San Diego, La Jolla, CA, Jan. 2008, pp. 433-437.
17. T.Wadayama, "Interior point decoding for linear vector channels based on convex optimization," in Proc. IEEE Int. Symp.Information Theory (ISIT 2008), Toronto, ON, Canada, Jul. 2008, pp. 1493-1497.
18. 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.
19. C. Daskalakis, A. G. Dimakis, R. M. Karp, and M. J. Wainwright, "Probabilistic analysis of linear programming decoding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3565-3578, Aug. 2008.
20. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
21. R. G. Jeroslow, "On defining sets of vertices of the hypercube by linear inequalities," Discr. Math., vol. 11, pp. 119-124, 1975.
22. D. Bertsekas, Convex Analysis and Optimization. Belmont, MA: Athena Scientific, 2003.
23. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
24. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
25. D. Burshtein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 782-790, Feb. 2001.
26. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transm., vol. 11, no. 1, pp. 18-28, May 1976.
27. D. Burshtein, "On the error correction of regular LDPC codes using the flipping algorithm," IEEE Trans. Inf. Theory, vol. 54, no. 2, pp. 517-530, Feb. 2008.
28. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Budapest, Hungary: Akadémiai Kiadó, Dec. 1997.
29. A. J. Hoffman, "On approximate solutions of systems of linear inequalities," J. Res. Nat. Bur. Stand., vol. 49, pp. 263-265, 1952.
30. O. Güler, A. J. Hoffman, and U. G. Rothblum, "Approximations to solutions to systems of linear inequalities," SIAM J. Matrix Anal. Appl., vol. 16, no. 2, pp. 688-696, Apr. 1995.
31. J. Boutros, O. Pothier, and G. Zemor, "Generalized low-density (Tanner) codes," in Proc. 1999 IEEE Int. Conf. Communication (ICC 1999), Vancouver, BC, Canada, Jun. 1999, pp. 441-445.
32. M. Lentmaier and K. Sh. Zigangirov, "On generalized low-density parity-check codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, no. 8, pp. 248-250, Aug. 1999.
33. T. Wadayama, "An extension of Gallager ensemble of low-density parity-check codes," IEICE Trans. Fundamentals of Electron., Commun. and Comput. Sci., vol. E85-A, no. 1, pp. 1161-1171, Jan. 2002.
34. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
35. A. Bennatan, "On Generalized LDPC Codes," M.Sc. thesis, Tel-Aviv Univ., Tel-Aviv, Israel, Apr. 2002.
36. A. Bennatan and D. Burshtein, "Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 549-583, Feb. 2006.
37. C. A. Kelley and D. Sridhara, "Eigenvalue bounds on the pseudocodeword weight of expander codes," Adv. Math. of Commun., vol. 1, no. 3, pp. 287-307, Aug. 2007.
38. J. Zhang and M. Fossorier, "Shuffled belief propagation decoding," in Proc. 36th Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Nov. 2002, vol. 1, pp. 8-15.
39. H. Kfir and I. Kanter, "Parallel versus sequential updating for belief propagation decoding," Physica A: Statist. Mech. Its Applic., vol. 330, no. 1-2, pp. 259-270, 2003.
40. E. Sharon, S. Litsyn, and J. Goldberger, "Efficient serial message-passing schedules for LDPC decoding," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4076-4091, 2007.