期刊文献+

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings
下载PDF
导出
摘要 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. 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.
出处 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第1期24-27,共4页 浙江大学学报(英文版)A辑(应用物理与工程)
基金 Project (No. 60332030) supported by the National Natural ScienceFoundation of China
关键词 Turbo codes Integer ring Permutation polynomial INTERLEAVER Maximum contention-free (MCF) 下一代移动通信系统 Turb码 交织器 设计 最大无争用特性 置换多项式
  • 相关文献

参考文献10

  • 1Dobkin, R,Peleg, M.,Ginosar, R.Parallel interleaver design and VLSI architecture for low-latency MAP Turbo decoders[].IEEE Trans VLSI Syst.2005
  • 2Berrou, C.,Glavieux, A.,Thitimajshima, P.Near Shannon Limit Error-correcting Coding and Decoding: Turbo-codes[].Proc ICC’.1993
  • 3Sun, J,Takeshita, O.Y.Interleavers for Turbo codes using permutation polynomials over integer rings[].IEEE Trans Inform Theory.2005
  • 4Dinoi, L,Benedetto, S.Variable-size interleaver design for parallel Turbo decoder architectures[].IEEE Trans Commun.2005
  • 5Hardy, G.H.,Wright, E.M.An Introduction to the Theory of Numbers[]..1979
  • 6Nimbalker, A,Blankenship, T.K.,Classon, B.,Fuja, T.E.,Costello, D.J.Jr.Contention-free Interleavers[].Proc ISIT’.2004
  • 7Thul, M.J,Gilbert, F.,Wehn, N.Optimized Concurrent Interleaving Architecture for High-throughput Turbo- decoding[].Proc ICECS’.2002
  • 8Ryu, J.,Takeshita, O.Y.On Quadratic Inverses for Quadratic Permutation Polynomials Over Integer Rings[].Http://arxivorg/PS_cache/cs/pdf/.2005
  • 9Takeshita,O.Y.On Maximum Contention-free Inter-leavers and Permutation Polynomials Over Integer Rings[].Http://arxivorg/PS_cache/cs/pdf/.2005
  • 10Li,S.J.Permutation Polynomials Modulo m[].Http://wwwhookleecom.2005

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部