Logistic Regression for LDPC Decoding Failure Prediction
Authors:
- 9 January 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
In this paper, we propose a regression analysis for the early stopping of low-density parity-check (LDPC) decoder to reduce computational complexity and decoding latency. The proposed scheme predicts the decoding failure of the LDPC decoder using logistic regression. The data sets for the decodability classification consist of the index of iteration and the number of unsatisfied parity checks. Simulation results show that with the proposed scheme, the average number of iterations of the LDPC decoder can be significantly reduced without performance loss. In addition, since the proposed scheme determines the decoding failure based on the instantaneous value, it has advantages in terms of memory and computational complexity compared to the early stopping schemes based on the changes in parameters.Keywords
This publication has 13 references indexed in Scilit:
- Early stopping criterion for LDPC2017
- Neural offset min-sum decoding2017
- Learning to decode linear codes using deep learning2017
- Safe Early Stopping for Layered LDPC DecodingIEEE Communications Letters, 2014
- New Stopping Criterion for Fast Low-Density Parity-Check DecodersIEEE Communications Letters, 2014
- A Unified Early Stopping Criterion for Binary and Nonbinary LDPC Codes Based on Check-Sum Variation PatternsIEEE Communications Letters, 2010
- A Stopping Criterion for Low-Density Parity-Check CodesIEICE Transactions on Communications, 2008
- Early stopping for LDPC decoding: convergence of mean magnitude (CMM)IEEE Communications Letters, 2006
- Low Complexity Stopping Criterion for LDPC Code Decoders2005
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962