期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings
1
作者 MA Xin-rui XU You-yun ZHANG Le 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第1期24-27,共4页
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 indispens... 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. 展开更多
关键词 Turbo codes Integer ring Permutation polynomial INTERLEAVER Maximum contention-free (MCF)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部