Different perspective and approach to implement adaptive normalised belief propagation-based decoding for low-density parity check codes

Different perspective and approach to implement adaptive normalised belief propagation-based decoding for low-density parity check codes

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, the authors propose an improved version of the min-sum algorithm for low-density parity check code decoding, which the authors call ‘adaptive normalised BP-based’ algorithm. Their decoder provides a compromise solution between belief propagation and the min-sum algorithms by adding an exponent offset to each variable node's intrinsic information in the check node update equation. The extrinsic information from the min-sum decoder is then adjusted by applying a negative power of the two scale factor, which can be easily implemented by right shifting the min-sum extrinsic information. The difference between their approach and other adaptive normalised min-sum decoders is that the authors select the normalisation scale factor using a clear analytical approach based on the underlying principles. The simulation results show that the proposed decoder outperforms the min-sum decoder and performs very close to the BP decoder with lower complexity.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • Jones, C., Valles, E., Smith, M., Villasenor, J.: `Approximate-MIN constraint node updating for LDPC code decoding', IEEE Military Communication Conf., October 2003, vol. 1, p. 157–162.
    5. 5)
      • Anastasopoulos, A.: `A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution', Proc. IEEE Globecom., November 2001, San Antonio, TX, p. 1021–1025.
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • J.L. Hennessy , D.A. Patterson . (1999) Computer architecture, system.
    13. 13)
    14. 14)
      • C. Winstead . (2005) Analog iterative error control decoders’. PhD dissertation.
    15. 15)
    16. 16)
    17. 17)
      • M. Ercegovac , T. Lang , J.H. Moreno . (1999) Introduction to digital system.
    18. 18)
      • C.B. Schlegel , L.C. Perez . (2004) Trellis and turbo coding.
    19. 19)
      • D.E. Knuth . (1969) The art of computer programming.
    20. 20)
      • Mohsenin, T., Baas, B.: `Trends and challenges in LDPC hardware decoders', Rec. 43rd Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, 1–4 November 2009, CA, p. 1273–1277.

Related content

This is a required field
Please enter a valid email address