ADMM Check Node Penalized Decoders for LDPC Codes
- 15 March 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (6) , 3528-3540
Abstract
Alternating direction method of multipliers (ADMM) is an efficient implementation of linear programming (LP) decoding for low-density parity-check (LDPC) codes. By adding penalty terms to the objective function of the LP decoding model, ADMM variable node (VN) penalized decoding can suppress the non-integral solutions and improve the frame error rate (FER) performance in the low signal-to-noise ratio (SNR) region. In this paper, we propose a novel ADMM check node (CN) penalized decoding algorithm. Codeword solutions which satisfy all parity-check equations will have smaller penalty values than non-codeword solutions, including the non-integral solutions. We discuss the required properties of CN-penalty functions, propose a few functions that satisfy those properties, and study their performance/complexity trade-offs. We also investigate the convergence properties of the proposed algorithm and prove that its performance is independent of the transmitted codeword. Using Monte Carlo simulations and instanton analysis, we then demonstrate that the proposed CN-penalized decoder outperforms ADMM VN penalized decoders in both waterfall and error floor regions. This comes at the expense of some increase in the decoding complexity.Keywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada (217239-2013-RGPIN)
This publication has 44 references indexed in Scilit:
- Fast Converging ADMM-Penalized Algorithm for LDPC DecodingIEEE Communications Letters, 2016
- Improved ADMM Penalized Decoder for Irregular Low-Density Parity-Check CodesIEEE Communications Letters, 2015
- Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC CodesIEEE Communications Letters, 2015
- Error Floor Approximation for LDPC Codes in the AWGN ChannelIEEE Transactions on Information Theory, 2014
- Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Diagnosis of Weaknesses in Modern Error Correction Codes: A Physics ApproachPhysical Review Letters, 2005
- Using Linear Programming to Decode Binary Linear CodesIEEE Transactions on Information Theory, 2005
- Improved Bounds on the Word Error Probability of$RA(2)$Codes With Linear-Programming-Based DecodingIEEE Transactions on Information Theory, 2005
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001