Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC

Details Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC

2011-12-16

arxiv.org/abs/1112.3730v1

Computer Science

Information Theory

6 pages, 3 figures. Presented at Globecom 2011, Houston, TX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136460