Abstract
Alternating Direction Method of Multipliers (ADM-M) is an effective method for Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes. In the ADMM-based LDPC decoding algorithm, Euclidean projection on the check polytope is the key step. Current Euclidean projection algorithms in general require either sorting or iterative operations. However, when decoding LDPC codes with high coding rate, the sorting operation brings a high level of computation complexity. Moreover, although the current iterative projection algorithms do not involve the complex operation of sorting, its convergence speed is slow. In this paper, based on trend extrapolation, a reduced-complexity iterative check polytope projection algorithm is proposed. In the proposed algorithm, the target projection point can be found based on the variation trend of the geometric position of the projection points obtained from previous iterations. Therefore, it ensures fast convergence and does not sacrifice on bit error rate (BER) performance. The simulation results confirm that the proposed algorithm can effectively reduce the decoding complexity, especially for LDPC codes with high coding rate.
Sign-in/Register to access full text options 
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.
