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

Authors

Eric T. Psota, University of Nebraska-LincolnFollow
Lance C. Perez, University of Nebraska-LincolnFollow

Date of this Version

3-2011

Citation

IEEE Communications Letters, Vol. 15, No. 3, March 2011.

Comments

Copyright IEEE 2011. Used by permission.

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.