A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
From MaRDI portal
Publication:5124468
Abstract: The Alternating Direction Method of Multipliers has recently been adapted for Linear Programming Decoding of Low-Density Parity-Check codes. The computation of the projection onto the parity polytope is the core of this algorithm and usually involves a sorting operation, which is the main effort of the projection. In this paper, we present an algorithm with low complexity to compute this projection. The algorithm relies on new findings in the recursive structure of the parity polytope and iteratively fixes selected components. It requires up to 37% less arithmetical operations compared to state-of-the-art projections. Additionally, it does not involve a sorting operation, which is needed in all exact state-of-the-art projection algorithms. These two benefits make it appealing for efficient hard- and software implementations.
Recommendations
- Decoding Nonbinary LDPC Codes via Proximal-ADMM Approach
- The ADMM Penalized Decoder for LDPC Codes
- ADMM LP Decoding of Non-Binary LDPC Codes in <inline-formula> <tex-math notation="LaTeX">$ \mathbb {F}_{2^{m}}$ </tex-math> </inline-formula>
- Hardware-Based Linear Program Decoding With the Alternating Direction Method of Multipliers
- Adaptive Methods for Linear Programming Decoding
- Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis
- Decomposition Methods for Large Scale LP Decoding
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search
This page was built for publication: A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124468)
