Complexity analysis of interior point methods for LP decoding

Linear programming (LP) decoders can outperform currently used message-passing decoders in channel coding applications, but require prohibitively large complexity on even moderately sized codes. Previous works have proposed complexity-reducing algorithms that either relax the problem or modify the number of constraints; however, little work is done in optimizing solver implementation. We show that popular LP solvers like LIPSOL may not be efficient for LP decoding (LPD), and that an equivalent dual LP problem can be solved with equal accuracy but much more quickly. We propose an improved primal-dual method (iPD-MPC) whose overall runtime for both problem formulations outpreform LIPSOL. Additionally, as an alternative for memory-limited systems, we propose an improved hybrid gradient descent and Newton's method (iGD-NM) that further decreases overall runtime. In this way, we make LPD more feasible for channel codes of practical lengths.

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

[2]  David Burshtein,et al.  Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity , 2008, IEEE Transactions on Information Theory.

[3]  Alexandros G. Dimakis,et al.  Guessing Facets: Polytope Structure and Improved LP Decoder , 2009, IEEE Transactions on Information Theory.

[4]  Paul H. Siegel,et al.  Adaptive Linear Programming Decoding , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

[7]  D. Sridhara,et al.  On the pseudocodeword weight and parity-check matrix redundancy of linear codes , 2007, 2007 IEEE Information Theory Workshop.

[8]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[9]  Yin Zhang,et al.  Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .

[10]  Michael Chertkov,et al.  Pseudo-codeword Landscape , 2007, 2007 IEEE International Symposium on Information Theory.

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

[12]  Stephen J. Wright,et al.  Primal-Dual Interior-Point Methods , 1997 .

[13]  Jon Feldman,et al.  Cascaded Formulation of the Fundamental Polytope of General Linear Block Codes , 2007, 2007 IEEE International Symposium on Information Theory.