.png){kind=icon}
返回
Concatenated decoding with a reduced-search BCJR algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/49.661107.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel cancatenated convolutional codes, One computes its recursions at only M states per trellis stage; one computes only at states with values above a threshold, The threshold scheme is much more efficient, and it greatly reduces the computation of the BCJR algorithm, By computing only when the channel demands it, the threshold scheme reduces the turbo decoder computation to one-four nodes per trellis stage after the second iteration.
Keyword:
complexity reduction
concatenated coding
decoders
error correction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容