Iterative Construction of Regular LDPC Codes from Independent Tree-Based Minimum Distance Bounds

Author

Psota, Eric ; Pérez, Lance C.

Author_Institution

Dept. of Electr. Eng., Univ. of Nebraska-Lincoln, Lincoln, NE, USA

Volume

15

Issue

3

fYear

2011

fDate

3/1/2011 12:00:00 AM

Firstpage

334

Lastpage

336

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

AWGN channels; channel coding; iterative methods; parity check codes; trees (mathematics); additive white Gaussian noise channel; approximate cycle extrinsic message degree; decision criterion; independent tree-based method; iterative construction; low density parity check code; lower bounding; minimum distance bounding; progressive edge growth; regular LDPC code; signal to noise ratio; Bit error rate; Decoding; Iterative decoding; Signal to noise ratio; Simulation; Switches; LDPC codes; computation tree; girth; iterative decoding; minimum distance; progressive edge-growth (PEG);

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2011.011311.102252

Filename

5696808