Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC
Information Theory
2011-12-19 v1 math.IT
Abstract
Using the EXIT chart approach, a necessary and sufficient condition is developed for the local stability of iterative decoding of multi-edge type (MET) doubly-generalized low-density parity-check (D-GLDPC) code ensembles. In such code ensembles, the use of arbitrary linear block codes as component codes is combined with the further design of local Tanner graph connectivity through the use of multiple edge types. The stability condition for these code ensembles is shown to be succinctly described in terms of the value of the spectral radius of an appropriately defined polynomial matrix.
Cite
@article{arxiv.1112.3730,
title = {Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC},
author = {Enrico Paolini and Mark F. Flanagan and Marco Chiani and Marc P. C. Fossorier},
journal= {arXiv preprint arXiv:1112.3730},
year = {2011}
}
Comments
6 pages, 3 figures. Presented at Globecom 2011, Houston, TX