Title :
Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
Author :
Takeshita, Oscar Y.
Author_Institution :
Ohio State Univ., Columbus
fDate :
6/1/2007 12:00:00 AM
Abstract :
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are interleavers whose spread factors achieve the upper bound. An infinite sequence of quadratic PPs over integer rings that generate maximum-spread interleavers is presented. New properties of PP interleavers are investigated from an algebraic-geometric perspective resulting in a new non- linearity metric for interleavers. A new interleaver metric that is a function of both the nonlinearity metric and the spread factor is proposed. It is numerically demonstrated that the spread factor has a diminishing importance with the block length. A table of good interleavers for a variety of interleaver lengths according to the new metric is listed. Extensive computer simulation results with impressive frame error rates confirm the efficacy of the new metric. Further, when tail-biting constituent codes are used, the resulting turbo codes are quasi-cyclic.
Keywords :
channel coding; interleaved codes; turbo codes; algebraic constructions; channel coding; geometry; maximum-spread interleavers; nonlinearity metric; permutation polynomial interleaves; quadratic permutation polynomials; spread factor; tail-biting constituent codes; turbo codes; Channel coding; Computer simulation; Error analysis; Geometry; Hardware; Parity check codes; Polynomials; Sufficient conditions; Turbo codes; Upper bound; Algebraic; PP; geometry; interleaver; quadratic; quasi-cyclic; spread; turbo code;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2007.896870