Iterative decoding threshold analysis for LDPC convolutional codes

Michael Lentmaier, Arvind Sridharan, Daniel J. Costello Jr., Kamil Zigangirov

Research output: Contribution to journalArticlepeer-review

285 Citations (SciVal)
2525 Downloads (Pure)


An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.
Original languageEnglish
Pages (from-to)5274-5289
JournalIEEE Transactions on Information Theory
Issue number10
Publication statusPublished - 2010

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • threshold analysis
  • density evolution
  • Belief propagation
  • iterative decoding
  • low-density
  • LDPC convolutional codes
  • message passing
  • parity-check (LDPC) codes


Dive into the research topics of 'Iterative decoding threshold analysis for LDPC convolutional codes'. Together they form a unique fingerprint.

Cite this