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.
Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC / E. Paolini; M. Flanagan; M. Chiani; M. Fossorier. - ELETTRONICO. - (2011), pp. 1-6. (Intervento presentato al convegno 2011 IEEE Global Telecommunications Conference tenutosi a Houston, TX nel December 2011) [10.1109/GLOCOM.2011.6134025].
Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC
PAOLINI, ENRICO;CHIANI, MARCO;
2011
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
