Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation
Abstract
We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated information, thereby mitigating the performance degradation caused by the greedy behavior of RBP-based algorithms and reducing error propagation. The Consensus and Delayed Return RBP algorithm (C&DR-RBP) achieves better performance in the early decoding iterations than C&R-RBP, making it particularly suitable for low-latency applications. Both proposed methods maintain the same computational complexity as the original RBP algorithm in terms of residual calculations. We also provide a formal analysis showing that the Consensus mechanism increases the probability of correct bit decisions under initial decoding conditions and in the presence of severe bit transmission errors, providing insight into the performance gains observed in the simulations. Numerical results based on the rapidly growing 5G New Radio (NR) standard, considering different code lengths, code rates, and channel models, demonstrate that both methods outperform competing RBP-based algorithms with similar overall computational complexity in terms of frame error rate (FER) and bit error rate (BER).
Related
- Low-Latency Belief-Propagation Decoding of Quantum LDPC Codes with Reinforcement-Learned Scheduling
- Dithered Belief Propagation for Real-Time Quantum Memory Decoding
- Logical Neural Belief Propagation for Linear-Complexity Decoding of Surface Codes
- Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding
- Conflict-Free Color-Clustered Sequential Belief-Propagation Decoding of Quantum LDPC Codes via Reinforcement Learning
BibTeX
@misc{feitosa2026lowlatency,
title = {{Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation}},
author = {Allan E. Feitosa and Rodrigo C. de Lamare},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.14387},
eprint = {2610.14387},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.14387},
}
RIS
TY - UNPB
TI - Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation
AU - Allan E. Feitosa
AU - Rodrigo C. de Lamare
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.14387
UR - https://arxiv.org/abs/2610.14387
AB - We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated information, thereby mitigating the performance degradation caused by the greedy behavior of RBP-based algorithms and reducing error propagation. The Consensus and Delayed Return RBP algorithm (C&DR-RBP) achieves better performance in the early decoding iterations than C&R-RBP, making it particularly suitable for low-latency applications. Both proposed methods maintain the same computational complexity as the original RBP algorithm in terms of residual calculations. We also provide a formal analysis showing that the Consensus mechanism increases the probability of correct bit decisions under initial decoding conditions and in the presence of severe bit transmission errors, providing insight into the performance gains observed in the simulations. Numerical results based on the rapidly growing 5G New Radio (NR) standard, considering different code lengths, code rates, and channel models, demonstrate that both methods outperform competing RBP-based algorithms with similar overall computational complexity in terms of frame error rate (FER) and bit error rate (BER).
ER -