Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels

TL;DR

This paper introduces a simple, fast deterministic method for designing irregular LDPC codes for binary erasure channels that closely approaches optimal performance and offers greater flexibility in code parameters.

Contribution

A new deterministic design method for LDPC codes that simplifies the process, improves flexibility, and achieves near-capacity performance with fewer parameters.

Findings

Designed codes perform close to optimal codes from optimization.

Method allows flexible selection of variable node degrees.

Codes can achieve channel capacity as parameters grow large.

Abstract

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as density evolution or Extrinsic Information Transfer (EXIT) charts in an optimization process, the proposed method is much simpler and faster. Through a number of examples, we demonstrate that the codes designed by the proposed method perform very closely to the best codes designed by optimization. An important property of the proposed designs is the flexibility to select the number of constituent variable node degrees P. The proposed designs include existing deterministic designs as a special case with P = N-1, where N is the maximum variable node degree. Compared to the existing deterministic designs, for a given rate and a given d > 0, the designed ensembles can have a threshold in d-neighborhood of the capacity upper bound with smaller values of P and N. They can also achieve the capacity of the BEC as N, and correspondingly P and the maximum check node degree tend to infinity.