|
|
A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings |
MA Xin-rui, XU You-yun, ZHANG Le |
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China; Institute of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China |
|
|
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.
|
Received: 26 February 2006
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|