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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
