| A proof of maximum contention-flee property of interleavers for Turbo codes using permutation polynomials over integer rings |
| |
| 作者姓名： | MA Xin-rui XU You-yun ZHANG Le |
| |
| 作者单位： | [1]Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China [2]Institute of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China |
| |
| 基金项目： | Project （No. 60332030） supported by the National Natural Science Foundation of China |
| |
| 摘 要： |
|
| 关 键 词： | 下一代移动通信系统 Turb码 交织器 设计 最大无争用特性 置换多项式 |
| 收稿时间： | 2006-02-26 |
| 修稿时间： | 2006-04-13 |
A proof of maximum contention-flee property of interleavers for Turbo codes using permutation polynomials over integer rings |
| |
| MA Xin-rui XU You-yun ZHANG Le.A proof of maximum contention-flee property of interleavers for Turbo codes using permutation polynomials over integer rings[J].Journal of Zhejiang University Science,2007,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 paraUelization 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 intedeaver length N, which, also called maximum contention-free interleavers. |
| |
| Keywords: | |
| 本文献已被 维普 等数据库收录！ |
