On the Decomposition Method for Linear Programming Decoding of LDPC Codes

In this paper, we focus on solving the linear programming (LP) problem that arises in the decoding of low-density parity-check (LDPC) codes by means of the revised simplex method. In order to take advantage of the structure of the LP problem, we reformulate the dual LP and apply the idea of Dantzig-Wolfe (D-W) decomposition method to solve the problem. Each subproblem in the D-W decomposition method is an LP over a convex polyhedral cone. We define the convex polyhedral cone as local parity-check cone and discuss its special structures. Then, we enumerate its extreme rays and use these extreme rays to design an efficient method for the general LP decoding problem. The proposed method exhibits advantages in reducing both the storage and computational requirements.

[1]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[2]  Pascal O. Vontobel,et al.  Interior-point algorithms for linear-programming decoding , 2008, 2008 Information Theory and Applications Workshop.

[3]  Ralf Koetter,et al.  On low-complexity linear-programming decoding of LDPC codes , 2007, Eur. Trans. Telecommun..

[4]  P. Vontobel.  Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[7]  Jon Feldman,et al.  Decoding error-correcting codes via linear programming , 2003 .

[8]  Ralf Koetter,et al.  Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.

[9]  Paul H. Siegel,et al.  Adaptive Methods for Linear Programming Decoding , 2008, IEEE Transactions on Information Theory.

[10]  P. Vontobel,et al.  On the Relationship between Linear Programming Decoding and Min-Sum Algorithm Decoding , 2004 .

[11]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[12]  P. Vontobel,et al.  Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.

[13]  Jon Feldman,et al.  Nonlinear programming approaches to decoding low-density parity-check codes , 2006, IEEE Journal on Selected Areas in Communications.

[14]  Yair Weiss,et al.  MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies , 2007, UAI.

[15]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[16]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[17]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[18]  Paul H. Siegel,et al.  Efficient implementation of linear programming decoding , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[19]  G. Dantzig,et al.  The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .

[20]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[21]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[22]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[23]  P. Vontobel,et al.  Graph-covers and iterative decoding of nite length codes , 2003 .