Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation

Details Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation

2012-04-11

arxiv.org/abs/1204.2435v1

Computer Science

Information Theory

16 pages, 6 figures. Submitted to IEEE Transactions on Information Theory

Scientific paper

This paper analyzes the asymptotic exponent of the weight spectrum for irregular doubly-generalized LDPC (D-GLDPC) codes. In the process, an efficient numerical technique for its evaluation is presented, involving the solution of a 4 x 4 system of polynomial equations. The expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. The spectral shape is shown to admit a particularly simple form in the special case where all variable nodes are repetition codes of the same degree, a case which includes Tanner codes; for this case it is also shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function. Finally, using these new results, weight and stopping set size spectral shapes are evaluated for some example generalized and doubly-generalized LDPC code ensembles.

Affiliated with

Also associated with

No associations

Rating

Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation 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 Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717066