Density evolution for two improved BP-Based decoding algorithms of LDPC codes
J. Chen, M.P.C. Fossorier · IEEE Communications Letters · 2002
In this letter, we analyze the performance of two improved belief propagation (BP) based decoding algorithms for LDPC codes, namely the normalized BP-based and the offset BP-based algorithms, by means of density evolution. The numerical calculations show that with one properly chosen parameter for each of these two improved BP-based algorithms, performances very close to that of the BP algorithm can be achieved. Simulation results for LDPC codes with code length moderately long validate the proposed optimization.
Cited by 437 works. doi:10.1109/4234.1001666
Authors
References
- Low-density parity-check codes
- Low-Density Parity-Check Codes
- Good error-correcting codes based on very sparse matrices
- The capacity of low-density parity-check codes under message-passing decoding
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
- On the construction of some capacity-approaching coding schemes
- Near optimum universal belief propagation based decoding of low-density parity check codes
- A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution
- Density evolution for low-density parity-checkcodes under Max-Log-MAP decoding