TY - GEN
T1 - Linear complexity approximate LP decoding of LDPC codes
T2 - 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
AU - Burshtein, David
PY - 2008
Y1 - 2008
N2 - The iterative algorithm, for low complexity linear programming (LP) decoding of low-density parity-check (LDPC) codes, proposed by Vontobel and Koetter, is considered. In this paper the convergence rate and computational complexity of this algorithm are studied using a scheduling scheme that we propose. In particular we are interested in obtaining a feasible vector in the LP decoding problem, with objective function value whose distance to the minimum, normalized by the block length, can be made arbitrarily small. It is shown that such a feasible vector can be obtained with linear, in the block length, computational complexity. Improved bounds on the convergence rate are also presented. The results extend to generalized LDPC (GLDPC) codes. It is also shown that previous results for LDPC and GLDPC codes, on the ability of the LP decoder to correct some fixed fraction of errors, hold with linear computational complexity when using the approximate iterative LP decoder.
AB - The iterative algorithm, for low complexity linear programming (LP) decoding of low-density parity-check (LDPC) codes, proposed by Vontobel and Koetter, is considered. In this paper the convergence rate and computational complexity of this algorithm are studied using a scheduling scheme that we propose. In particular we are interested in obtaining a feasible vector in the LP decoding problem, with objective function value whose distance to the minimum, normalized by the block length, can be made arbitrarily small. It is shown that such a feasible vector can be obtained with linear, in the block length, computational complexity. Improved bounds on the convergence rate are also presented. The results extend to generalized LDPC (GLDPC) codes. It is also shown that previous results for LDPC and GLDPC codes, on the ability of the LP decoder to correct some fixed fraction of errors, hold with linear computational complexity when using the approximate iterative LP decoder.
UR - http://www.scopus.com/inward/record.url?scp=57849125140&partnerID=8YFLogxK
U2 - 10.1109/TURBOCODING.2008.4658668
DO - 10.1109/TURBOCODING.2008.4658668
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:57849125140
SN - 9781424428632
T3 - 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
SP - 31
EP - 36
BT - 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Y2 - 1 September 2008 through 5 September 2008
ER -