Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles

Details Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles

2009-05-22

arxiv.org/abs/0905.3733v1

Computer Science

Information Theory

5 pages, to appear in proc. IEEE ISIT, June 2009

Scientific paper

The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping set enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asymptotic expressions when the block length tends to infinity and evaluate them numerically.

Affiliated with

Also associated with

No associations

Rating

Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles 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 Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326047