.png){kind=icon}
返回
Simplified Log-MAP Algorithm for Very Low-Complexity Turbo Decoder Hardware Architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/TIM.2013.2281554.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, yet effective, n-input max* approximation algorithm is proposed with the aim being its efficient implementation for very low-complexity turbo decoder hardware architectures. The simplification is obtained using an appropriate digital circuit for finding the first two maximum values in a set of n data that embeds the computation of a correction term. Various implementation results show that the proposed architecture is simpler by 30%, on average, than the constant logarithmic-maximum a posteriori (Log-MAP) one, in terms of chip area with the same delay. This comes at the expense of very small performance degradation, in the order of 0.1 dB for up to moderate bit error rates, e. g., 10(-5), assuming binary turbo codes. However, when applying scaling to the extrinsic information, the proposed algorithm achieves almost identical Log-MAP turbo code performance for both binary and double-binary turbo codes, without increasing noticeably the implementation complexity.
Keyword:
Digital circuit
logarithmic maximum a posteriori (Log-MAP)
Max-Log-MAP
turbo codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.9W
被引数:
5.8W
机构
引用论文
.png){kind=icon}
On Optimal and Near-Optimal Turbo Decoding Using Generalized max* Operator关于使用广义max * 算子的最优和近似最优Turbo解码
OAAI
OAAI分享收藏An improved Max-Log-MAP algorithm for turbo decoding and turbo equalization用于turbo解码和turbo均衡的改进max-log-map算法
PREAI
分享收藏分享收藏分享收藏
查看更多内容