On maximum contention-free interleavers and permutation polynomials over integer rings
Top Cited Papers
- 6 March 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (3) , 1249-1253
- https://doi.org/10.1109/tit.2005.864450
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 Third Generation Partnership Project (3GPP) standardKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A decoder architecture for high-speed free-space laser communicationsPublished by SPIE-Intl Soc Optical Eng ,2005
- Parallel interleaver design and VLSI architecture for low-latency MAP turbo decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 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 modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Concurrent interleaving architectures for high-throughput channel codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel turbo coding interleavers: avoiding collisions in accesses to storage elementsElectronics Letters, 2002
- Interleaver design for turbo codesIEEE Journal on Selected Areas in Communications, 2001
- New deterministic interleaver designs for turbo codesIEEE Transactions on Information Theory, 2000
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexityIEEE Transactions on Information Theory, 1999