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

Eric Psota, Lance C Perez

Research output: Contribution to journalArticle

6 Citations (Scopus)

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

Low-density Parity-check (LDPC) Codes
Minimum Distance
Girth
Gaussian White Noise
Signal to noise ratio
Lower bound
Cycle
Simulation

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

Iterative construction of regular LDPC codes from independent tree-based minimum distance bounds. / Psota, Eric; Perez, Lance C.

In: IEEE Communications Letters, Vol. 15, No. 3, 5696808, 01.03.2011, p. 334-336.

Research output: Contribution to journalArticle

@article{606d0885fdd5497a85251155667e9328,
title = "Iterative construction of regular LDPC codes from independent tree-based minimum distance bounds",
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.",
keywords = "LDPC codes, computation tree, girth, iterative decoding, minimum distance, progressive edge-growth (PEG)",
author = "Eric Psota and Perez, {Lance C}",
year = "2011",
month = "3",
day = "1",
doi = "10.1109/LCOMM.2011.011311.102252",
language = "English (US)",
volume = "15",
pages = "334--336",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

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

AU - Psota, Eric

AU - Perez, Lance C

PY - 2011/3/1

Y1 - 2011/3/1

N2 - 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.

AB - 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.

KW - LDPC codes

KW - computation tree

KW - girth

KW - iterative decoding

KW - minimum distance

KW - progressive edge-growth (PEG)

UR - http://www.scopus.com/inward/record.url?scp=79952698621&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952698621&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2011.011311.102252

DO - 10.1109/LCOMM.2011.011311.102252

M3 - Article

AN - SCOPUS:79952698621

VL - 15

SP - 334

EP - 336

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

M1 - 5696808

ER -