Shuffled belief propagation decoding
Juntan Zhang, M.P.C. Fossorier · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · 2003
In this paper, we propose a shuffled version of the belief propagation (BP) algorithm for the decoding of low-density parity-check (LDPC) codes. We show that when the Tanner graph of the code is acyclic and connected, the proposed scheme is optimal in the sense of MAP decoding and converges faster (or at least no slower) than the standard BP algorithm. Interestingly, this new version keeps the computational advantages of the forward-backward implementations of BP decoding. Both serial and parallel implementations are considered. We show by simulation that the new schedule offers better performance/complexity trade-offs.
Cited by 131 works. doi:10.1109/acssc.2002.1197141
Authors
References
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Low-Density Parity-Check Codes
- Good error-correcting codes based on very sparse matrices
- A recursive approach to low complexity codes
- Near Shannon limit performance of low density paritycheck codes
- Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963)
- Density evolution for two improved BP-Based decoding algorithms of LDPC codes
- Parallel versus sequential updating for belief propagation decoding