A New Metric for Permutation Polynomial Interleavers
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1983-1987
Abstract
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. 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-cyclicKeywords
This publication has 13 references indexed in Scilit:
- On quadratic inverses for quadratic permutation polynomials over integer ringsIEEE Transactions on Information Theory, 2006
- On maximum contention-free interleavers and permutation polynomials over integer ringsIEEE Transactions on Information Theory, 2006
- Maximum Spread of$D$-Dimensional Multiple Turbo CodesIEEE Transactions on Communications, 2005
- Interleavers for turbo codes using permutation polynomials over integer ringsIEEE Transactions on Information Theory, 2005
- A logarithmic upper bound on the minimum distance of turbo codesIEEE Transactions on Information Theory, 2004
- High-performance low-memory interleaver banks for turbo-codes2002
- Interleaver design for turbo codesIEEE Journal on Selected Areas in Communications, 2001
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexityIEEE Transactions on Information Theory, 1999
- Geometrically uniform codesIEEE Transactions on Information Theory, 1991
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958