On quasi-cyclic interleavers for parallel turbo codes

Details On quasi-cyclic interleavers for parallel turbo codes On quasi-cyclic interleavers for parallel turbo codes

2005-02-10

arxiv.org/abs/cs/0502055v1

IEEE Transactions on Information Theory, IT-52, No 4 (2006) pp. 1732--1739.

Computer Science

Information Theory

15 pages, 2 eps figures

Scientific paper

We present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e. growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes.

Affiliated with

Also associated with

No associations

Rating

On quasi-cyclic interleavers for parallel turbo codes 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 On quasi-cyclic interleavers for parallel turbo codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On quasi-cyclic interleavers for parallel turbo codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-546800