Iterative construction of regular LDPC codes from independent tree-based minimum distance bounds

Eric Psota, Lance C. Pérez

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

An independent tree-based method for lower bounding the minimum distance of low-density parity-check (LDPC) codes is presented. This lower-bound is then used as the decision criterion during the iterative construction of regular LDPC codes. The new construction algorithm results in LDPC codes with greater girth and improved minimum-distance bounds when compared to regular LDPC codes constructed using the progressive edge-growth (PEG) construction and the approximate cycle extrinsic message degree (ACE)-constrained PEG construction. Simulation results of codes constructed with the new method show improved performance on the additive white Gaussian noise channel at moderate signal-to-noise ratios.

Original languageEnglish (US)
Article number5696808
Pages (from-to)334-336
Number of pages3
JournalIEEE Communications Letters
Volume15
Issue number3
DOIs
StatePublished - Mar 1 2011

    Fingerprint

Keywords

  • LDPC codes
  • computation tree
  • girth
  • iterative decoding
  • minimum distance
  • progressive edge-growth (PEG)

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this