Linear complexity approximate LP decoding of LDPC codes: Generalizations and improvements
Burshtein, D.
Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv;
This paper appears in: Turbo Codes and Related Topics, 2008 5th International Symposium on
Publication Date: 1-5 Sept. 2008
On page(s): 31-36
Location: Lausanne,
ISBN: 978-1-4244-2862-5
INSPEC Accession Number: 10368844
Digital Object Identifier: 10.1109/TURBOCODING.2008.4658668
Current Version Published: 2008-10-24
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
