Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective

DOI10.1109/TIT.2007.896870MaRDI QIDQ3548218zbMATH OpenDBLPWikidataFDO

Authors Oscar Yassuo Takeshita

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0601048

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Combined modulation schemes (including trellis codes) in coding theory (94B12) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)

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 permutation polynomials over integer rings that generate maximum-spread interleavers is presented. New properties of permutation polynomial 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 non-linearity 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.

Recommendations

• Interleavers for turbo codes using permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings
• New deterministic interleaver designs for turbo codes
• On quadratic inverses for quadratic permutation polynomials over integer rings
• A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings

Cited in

(12)

• Effect of random permutations applied to random sequences and related applications
• Permutation polynomial interleavers for turbo codes
• Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers
• Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers
• Permutation fixed points with application to estimation of minimum distance of turbo codes
• On quadratic inverses for quadratic permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings
• Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
• New deterministic interleaver designs for turbo codes
• Polynomial functions over dual numbers of several variables
• A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings
• Design of two step deterministic interleaver for turbo codes

This page was built for publication: Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548218)