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

TL;DR

This paper demonstrates that permutation polynomials can generate maximum contention-free interleavers, enabling efficient parallel decoding in turbo codes, with simulations confirming their excellent performance for 3GPP standards.

Contribution

It introduces a novel algebraic method using permutation polynomials to design maximum contention-free interleavers for turbo codes.

Findings

Permutation polynomial-based interleavers are maximum contention-free.

These interleavers enable flexible parallel processing levels.

Turbo codes with these interleavers perform well in 3GPP standards.

Abstract

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.