Low-complexity bound on irregular LDPC belief-propagation decoding thresholds using a Gaussian approximation

Low-complexity bound on irregular LDPC belief-propagation decoding thresholds using a Gaussian approximation

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:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Since irregular low-density parity-check (LDPC) codes are known to perform better than regular ones, and to exhibit, like them, the so-called ‘threshold phenomenon’, this Letter investigates a low-complexity upper bound on belief-propagation decoding thresholds for this class of codes on memoryless binary input additive white Gaussian noise channels, with sum-product decoding. A simplified analysis of the belief-propagation decoding algorithm is used, i.e. consider a Gaussian approximation for message densities under density evolution, and a simple algorithmic method, defined recently, to estimate the decoding thresholds for regular and irregular LDPC codes.


    1. 1)
    2. 2)
      • 2. Luby, M.G., Mitzenmacher, M., Shokrollahi, M.A., et al: ‘Analysis of low density codes and improved design using irregular graphs’. Proc. 1998 Annual Int. Conf. (ACM) Symp. Theory of Computing, Dallas, TX, USA, May 1968, pp. 249258.
    3. 3)
    4. 4)
      • 4. Geller, L., Burshtein, D.: ‘Bounds on the belief propagation threshold of non-binary LDPC codes’. Proc. of the 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 2012, pp. 357361.
    5. 5)
      • 5. Pearl, J.: ‘Probabilistic reasoning in intelligent systems: networks of plausible inference’ (Morgan Kaufmann Publishers, Burlington, MA, USA, 1988).
    6. 6)
    7. 7)
    8. 8)
    9. 9)
      • 9. Babich, F., Noschese, M., Soranzo, A., et al: ‘Low complexity rate compatible puncturing patterns design for LDPC codes’. Proc. of the 2017 Int. Conf. SoftCOM, Split, Croatia, 21–23 September 2017.
    10. 10)
      • 10. Babich, F., Noschese, M., Vatta, F.: ‘Analysis and design of rate compatible LDPC codes’. Proc. of the 27th IEEE Int. Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC'16), Valencia, Spain, 4–8 September 2016, pp. 16.

Related content

This is a required field
Please enter a valid email address