On low-complexity linear-programming decoding of LDPC codes

We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While one can use any general-purpose LP solver to solve the LP that appears in the decoding problem, we argue in this paper that the LP at hand is equipped with a lot of structure that can be exploited. Towards this goal, we study the dual LP and show how coordinate-ascent methods lead to very simple update rules that are tightly connected to the min-sum algorithm. Moreover, replacing minima in the formula of the dual LP with soft-minima one obtains update rules that are tightly connected to the sum-product algorithm. This shows that LP solvers with complexity similar to the min-sum algorithm and the sum-product algorithm are feasible. Copyright © 2007 John Wiley & Sons, Ltd.

[1]  Ralf Koetter,et al.  Lower bounds on the minimum pseudoweight of linear codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Roxana Smarandache,et al.  On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes , 2005, ArXiv.

[3]  Yair Weiss,et al.  Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[4]  Paul H. Siegel,et al.  Relaxation bounds on the minimum pseudo-weight of linear block codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[5]  Martin J. Wainwright,et al.  On the Optimality of Tree-reweighted Max-product Message-passing , 2005, UAI.

[6]  Yair Weiss,et al.  Linear Programming Relaxations and Belief Propagation - An Empirical Study , 2006, J. Mach. Learn. Res..

[7]  Hans-Andrea Loeliger,et al.  On Factor Graphs and Electrical Networks , 2003, Mathematical Systems Theory in Biology, Communications, Computation, and Finance.

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

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

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

[11]  Martin J. Wainwright,et al.  MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.

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

[13]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[14]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

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

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

[17]  Vladimir Kolmogorov,et al.  Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Lars K. Rasmussen,et al.  The serial and parallel belief propagation algorithms , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[19]  G.D. Forney,et al.  Codes on graphs: Normal realizations , 2000, IEEE Trans. Inf. Theory.

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

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

[22]  C. Richard Johnson,et al.  A convergence proof for the turbo decoder as an instance of the gauss-seidel iteration , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..