A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings
Authors:
- 1 January 2007
- journal article
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 8 (1) , 24-27
Abstract
It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the parallelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the interleaver length N, which, also called maximum contention-free interleavers.Keywords
This publication has 9 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
- Variable-Size Interleaver Design for Parallel Turbo Decoder ArchitecturesIEEE Transactions on Communications, 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
- Contention-free interleavers2004
- Design of Flexible-Length S-Random Interleaver for Turbo CodesIEEE Communications Letters, 2004
- Optimized concurrent interleaving architecture for high-throughput turbo-decoding2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002