Constructing LDPC codes by error minimization progressive edge growth

Eran Sharon*, Simon Litsyn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A novel approach to constructing Tanner graphs using progressive edge growth (PEG) is introduced. It yields LDPC codes providing minimized block error probability in Binary Erasure Channels (BEC). The constructed codes exhibit superior performance over codes generated by previously known algorithms, both for BEC and AWGN channels. Furthermore, an upper bound on the expected block error probability in the error floor region of the generated codes is derived. This allows analytical prediction of the codes' error floor performance. Finally, the method is generalized for generating simple in implementation LDPC codes based on lifted graphs.

Original languageEnglish
Pages (from-to)359-368
Number of pages10
JournalIEEE Transactions on Communications
Volume56
Issue number3
DOIs
StatePublished - Mar 2008

Keywords

  • Error floor
  • LDPC codes
  • Lifted graphs
  • Progressive edge growth (PEG)
  • Stopping sets
  • Trapping sets

Cite this