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 

基　　金：Project (No. 60332030) supported by the National Natural ScienceFoundation of China 

出 版 物：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 (浙江大学学报（英文版）A辑（应用物理与工程）)

年 卷 期：2007年第8卷第1期

页      码：24-27页

摘      要：It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free inter-leaver 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 inter-leavers 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.

主 题 词：下一代移动通信系统 Turb码 交织器 设计 最大无争用特性 置换多项式 

学科分类：0810[工学-土木类] 080904[080904] 0809[工学-计算机类] 08[工学] 080402[080402] 0804[工学-材料学] 0805[工学-能源动力学] 081001[081001] 0812[工学-测绘类] 

核心收录：

D　O　I：10.1631/jzus.2007.A0024

馆 藏 号：203916931...