.png){kind=icon}
返回
Reduced complexity interleaver growth algorithm for turbo codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2005.847094.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper is focused on the problem of significantly reducing the complexity of the recursive interleaver growth algorithm (IGA) with the goal of extending the range of applicability of the algorithm to significantly larger interleavers; for a given CPU time and processor. In particular, we present two novel modifications to IGA changing the complexity order of the algorithm from 0 (N..) to 0 (N..), present several further minor modifications reducing the CPU time albeit not fundamentally changing the complexity order, and present a mixed mode strategy that combines the results of complexity reduction techniques that do not alter the algorithm outcome itself, with a novel transposition value set cardinality constrained design that does modify the optimization results. The mixed strategy can be used to further extend the range of interleaver sizes by changing the complexity order from O (N-max(2)) to O (N-max) (i.e., linear in the interleaver size). Finally, we present optimized variable length interleavers for the Universal Mobile Telecommunications System (UNITS) and Consultative Committee for Space Data Systems (CCSDS) standards outperforming the best interleavers proposed in the literature.
Keyword:
complexity
interleavers
iterative algorithms
optimization
permutations
turbo codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
Teaching Note—BSW Students’ Experiences With an MBSR Assignment and the Five Facets of Mindfulness
.png){kind=icon}
PREAI
分享收藏Potassium triisopropylsilanethiolate: Vinyl and aryl sulfides through Pd-catalyzed cross coupling
PREAI
分享收藏Suppression of systemic lupus erythematosus in NZBWF1 mice infected with Hymenolepis microstoma
PREAI
分享收藏
查看更多内容