Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (21578095) , 1988-1992
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. Also, the recently proposed quadratic permutation polynomial (QPP) based interleavers by Sun and Takeshita (IEEE Trans. Inform. Theory, Jan. 2005) provide excellent performance for short-to-medium block lengths. In this work the minimum distance of turbo codes with QPP-based interleavers is considered in detail. Large tables of optimum (in terms of turbo code minimum distance and multiplicity) QPPs for turbo codes with 8-state and 16-state constituent codes are presented. The minimum distances are compared to existing results in the literature on dithered relative prime (DRP) interleavers. The optimality of the new tables makes them an excellent source of information to advance the understanding of permutation polynomial (PP) based interleaversKeywords
All Related Versions
This publication has 8 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
- Improved Algorithms for the Determination of Turbo-Code Weight DistributionsIEEE Transactions on Communications, 2005
- Interleavers for turbo codes using permutation polynomials over integer ringsIEEE Transactions on Information Theory, 2005
- Designing good permutations for turbo codes: towards a single model2004
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002
- Turbo codes for PCS applications2002
- Interleaver design for turbo codesIEEE Journal on Selected Areas in Communications, 2001