Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes

• Published in: IEEE transactions on communications Vol. 59; no. 3; pp. 740 - 749
• Main Authors: Ngatched, Telex Magloire Nkouatchah, Alfa, Attahiru Sule, Jun Cai
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.03.2011; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Approximation; Approximation algorithms; Approximation methods; Barriers; Belief propagation (BP) algorithm; Coding, codes; Complexity; Complexity theory; Computer simulation; convex optimization; Decoding; Exact sciences and technology; finite geometries; Information, signal and communications theory; interior point algorithm; Iterative decoding; Linear programming; low-density parity-check (LDPC) codes; Maximum likelihood decoding; Performance degradation; Polytopes; Signal and communications theory; Telecommunications and information theory; weighted bit-flipping (WBF) algorithm; Performance evaluation; Polytope; weighted bit-flipping (WBF) algorithm; Bit flipping; Multistage method; Interior point method; Linear programming; Belief propagation (BP) algorithm; Decoding; Algorithm; Convex programming; Implementation; Degradation; Credal approach; Simulation; low-density parity-check (LDPC) codes; finite geometries; Algorithm complexity; convex optimization; Error correcting code; Parity check codes; interior point algorithm; Parity check
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2011.011811.090638

This paper presents a hybrid decoding algorithm for low-density parity-check (LDPC) codes based on the interior point method with barrier function for linear programming (LP) decoding introduced by Wadayama . First, an efficient implementation of Wadayama's algorithm is presented. The main idea behind the modification is to approximate the barrier function for the fundamental polytope defining the code so that it contains only one linear constraint for each of the parity-check constraints. A two-stage hybrid decoding which combines the interior point decoding and a low-complexity decoding algorithm for LDPC codes is then proposed. Simulation results show that the approximations introduced in the proposed algorithms do not result in any performance degradation, while considerably reducing the decoding complexity and latency.