List-Based Residual Belief-Propagation Decoding of LDPC Codes
- 25 March 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (5) , 984-988
Abstract
This letter presents an enhanced list-based residual belief propagation (L-RBP) method for decoding low-density parity-check (LDPC) codes. L-RBP reduces computational complexity by scheduling a concise list of residuals. Moreover, the list is partially renewed to deter a small cluster of residuals from monopolizing renewal opportunities. Simultaneously, we also incorporate a decay mechanism to constrain the residuals retained within the list, further mitigating the greediness of the algorithm. The numerical results indicate that the L-RBP has an attractive convergence speed, error rate performance, and complexity of long-length and low-rate codes in the additive white Gaussian noise (AWGN) channel.Keywords
Funding Information
- National Natural Science Foundation of China (62271069)
This publication has 13 references indexed in Scilit:
- Check-Belief Propagation Decoding of LDPC CodesIEEE Transactions on Communications, 2023
- Two Effective Scheduling Schemes for Layered Belief Propagation of 5G LDPC CodesIEEE Communications Letters, 2020
- Improved Decoding Algorithms of LDPC Codes Based on Reliability Metrics of Variable NodesIEEE Access, 2019
- Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC CodesIEEE Access, 2019
- Low-Complexity Belief-Propagation Decoding via Dynamic Silent-Variable-Node-Free SchedulingIEEE Communications Letters, 2016
- Two Informed Dynamic Scheduling Strategies for Iterative LDPC DecodersIEEE Transactions on Communications, 2013
- LDPC Decoders with Informed Dynamic SchedulingIEEE Transactions on Communications, 2010
- Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes2007
- Progressive edge-growth Tanner graphs2002
- Turbo decoding as an instance of Pearl's "belief propagation" algorithmIEEE Journal on Selected Areas in Communications, 1998