.png){kind=icon}
返回
VLSI architectures for the MAP algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2003.809247.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents several techniques for the very large-scale integration (VLSI) implementation of the maximum a posteriori (MAP) algorithm. In general, knowledge about the implementation of the Viterbi algorithm can be applied to the MAP algorithm. Bounds are derived for the dynamic range of the state metrics which enable the designer to optimize the word length. The computational kernel of the algorithm is the Add-MAX* operation, which is the Add-Compare-Select operation of the Viterbi algorithm with an added offset. We show that the critical path of the algorithm can be reduced if the Add-MAX* operation is reordered into an Offset-Add-Compare-Select operation by adjusting the location of registers. A general scheduling for the MAP algorithm is presented which gives the tradeoffs between computational complexity, latency, and memory size. Some of these architectures eliminate the need for RAM blocks with unusual form factors or can replace the RAM with registers. These architectures are suited to VLSI implementation of turbo decoders.
Keyword:
forward-backward algorithm
MAP estimation
turbo codes
very large-scale integration (VLSI)
Viterbi decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏分享收藏Nanostructured hybrid NiFeOOH/CNT electrocatalysts for oxygen evolution reaction with low overpotential.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏分享收藏
查看更多内容