.png){kind=icon}
返回
Early detection and trellis splicing: Reduced-complexity iterative decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/49.661104.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The excellent bit-error rate (BER) performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding procedure, In this paper, we present a method called early defection that can be used to reduce the computational complexity of a variety of iterative decoders, Using a confidence criterion, some information symbols, state variables, and codeword symbols are detected early on during decoding, In this way, the computational complexity of further processing is reduced with a controllable increase in BER. We present an easily implemented instance of this algorithm, called trellis splicing, that can be used with turbodecoding, For a simulated system of this type, we obtain a reduction in computational complexity of up to a factor of four, relative to a turbodecoder that obtains the same increase in BER by performing fewer iterations.
Keyword:
TURBO-CODES
CONVOLUTIONAL-CODES
SYSTEMS
PERFORMANCE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容