Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis
arXiv:1910.12712 · doi:10.1109/TSP.2020.2964223
Abstract
This paper presents an efficient quadratic programming (QP) decoder via the alternating direction method of multipliers (ADMM) technique, called QP-ADMM, for binary low-density parity-check (LDPC) codes. Its main contents are as follows: first, we relax maximum likelihood (ML) decoding problem to a non-convex quadratic program. Then, we develop an ADMM solving algorithm for the formulated non-convex QP decoding model. In the proposed QP-ADMM decoder, complex Euclidean projections onto the check polytope are eliminated and variables in each updated step can be solved analytically in parallel. Moreover, it is proved that the proposed ADMM algorithm converges to a stationary point of the non-convex QP problem under the assumption of sequence convergence. We also verify that the proposed decoder satisfies the favorable property of the all-zeros assumption. Furthermore, by exploiting the inside structures of the QP model, the complexity of the proposed algorithm in each iteration is shown to be linear in terms of LDPC code length. Simulation results demonstrate the effectiveness of the proposed QP-ADMM decoder.
References in corpus (7)
- Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
- The ADMM penalized decoder for LDPC codes
- Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
- Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
- Hardware Based Projection onto The Parity Polytope and Probability Simplex
- Efficient Linear Programming Decoding of HDPC Codes
- Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance