An analysis of the block error probability performance of iterative decoding

Michael Lentmaier, Dmitri Truhachev, Kamil Zigangirov, Daniel J. Costello Jr.

Research output: Contribution to journalArticlepeer-review

54 Citations (SciVal)


Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.
Original languageEnglish
Pages (from-to)3834-3855
JournalIEEE Transactions on Information Theory
Issue number11
Publication statusPublished - 2005

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • block error probability
  • LDPC codes
  • generalized LDPC codes
  • GLDPC codes
  • turbo codes
  • iterative decoding


Dive into the research topics of 'An analysis of the block error probability performance of iterative decoding'. Together they form a unique fingerprint.

Cite this