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

Eric Psota; Lance C. Pérez

doi:10.1109/LCOMM.2011.011311.102252

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

Eric Psota, Lance C. Pérez

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Article number	5696808
Pages (from-to)	334-336
Number of pages	3
Journal	IEEE Communications Letters
Volume	15
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2011.011311.102252
State	Published - Mar 2011

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

Access to Document

10.1109/LCOMM.2011.011311.102252

Cite this

@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 P{\'e}rez, {Lance C.}",

year = "2011",

month = mar,

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 - Pérez, Lance C.

PY - 2011/3

Y1 - 2011/3

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

SN - 1089-7798

VL - 15

SP - 334

EP - 336

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

M1 - 5696808

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this