.png){kind=icon}
返回
Fast Chase algorithm with an application in turbo decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/26.957387.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (RSC)-based turbo systems. Rather than employ trellis-based decoders, an algebraic decoder may be repeatedly employed in a low-complexity, soft-input/soft-output errors-and-erasures decoder such as the Chase algorithm. Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced without degrading performance. The result is a highly efficient Fast Chase implementation; the algorithm presented here is principally applicable to single error-correcting codes although consideration is also given to the more general case. The new decoder's value in practical turbo schemes is demonstrated via application to decoding of the (64,57,4) extended Hamming TPC.
Keyword:
Hamming codes
linear codes
MAP estimation
maximum-likelihood decoding
product codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
New P–Se compounds from the reaction of 2,4-bis(phenyl)-1,3-diselenadiphosphetane-2,4-diselenide with alkyl-diols.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
分享收藏
查看更多内容