Evaluation and design of irregular LDPC codes using ACE spectrum

Authors:
Dejan Vukobratovic;Vojin Šenk
Affiliations:
Dept. of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia;Dept. of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 6
Cited 0

The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory
Construction of Irregular LDPC Codes by Quasi-Cyclic Extension

IEEE Transactions on Information Theory
Computing the Stopping Distance of a Tanner Graph Is NP-Hard

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The construction of finite-length irregular LDPC codes with low error floors is currently an attractive research problem. In particular, for the binary erasure channel (BEC), the problem is to find the elements of selected irregular LDPC code ensembles with the size of their minimum stopping set being maximized. Due to the lack of analytical solutions to this problem, a simple but powerful heuristic design algorithm, the approximate cycle extrinsic message degree (ACE) constrained design algorithm, has recently been proposed. Building upon the ACE metric associated with a cycle in a code graph, we introduce the ACE spectrum of LDPC codes as a useful tool for evaluation of codes from selected irregular LDPC code ensembles. Using the ACE spectrum, we generalize the ACE constrained design algorithm, making it more flexible and efficient. We justify the ACE spectrum approach through examples and simulation results.