Near optimum universal belief propagation based decoding of low-density parity check codes
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 50 (3), 406-414
- https://doi.org/10.1109/26.990903
Abstract
In this paper, we propose a belief-propagation (BP)-based decoding algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified BP-based algorithm. The normalization factors can be obtained not only by simulation, but also, importantly, theoretically. This new BP-based algorithm is much simpler to implement than BP decoding as it requires only additions of the normalized received values and is universal, i.e., the decoding is independent of the channel characteristics. Some simulation results are given, which show this new decoding approach can achieve an error performance very close to that of BP on the additive white Gaussian noise channel, especially for low-density parity check (LDPC) codes whose check sums have large weights. The principle of normalization can also be used to improve the performance of the max-log-MAP algorithm in turbo decoding, and some coding gain can be achieved if the code length is long enough.Keywords
This publication has 21 references indexed in Scilit:
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- On multilevel codes and iterative multistage decodingIEEE Transactions on Communications, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- Comparison of constructions of irregular Gallager codesIEEE Transactions on Communications, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974