On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings

Details On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings

2005-06-24

arxiv.org/abs/cs/0506093v2

Computer Science

Information Theory

13 pages, 2 figures, submitted as a correspondence to the IEEE Transactions on Information Theory, revised version

Scientific paper

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Contention-free interleavers have been recently shown to be suitable for parallel decoding of turbo codes. In this correspondence, it is shown that permutation polynomials generate maximum contention-free interleavers, i.e., every factor of the interleaver length becomes a possible degree of parallel processing of the decoder. Further, it is shown by computer simulations that turbo codes using these interleavers perform very well for the 3rd Generation Partnership Project (3GPP) standard.

Affiliated with

Also associated with

No associations

Rating

On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings 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 Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577539