.png){kind=icon}
返回
Fast tree-Trellis list Viterbi decoding
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2006.869812.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A list Viterbi algorithm (LVA) finds the n most likely paths in a trellis diagram of a convolutional code. One of the most efficient LVAs is the tree-trellis algorithm of Soong and Huang. We propose a new implementation of this algorithm. Instead of storing the candidate paths in a single list sorted according to the metrics of the paths, we show that it is computationally more efficient to use several unsorted lists, where all paths of the same list have the same metric. For an arbitrary integer bit metric, both the time and space complexity of our implementation are linear in n. Experimental results for a binary symmetric channel and an additive white Gaussian noise channel show that our implementation is much faster than all previous LVAs.
Keyword:
algorithms
concatenated coding
convolutional codes
Viterbi decoding
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
Fatigue life evaluation of mechanical components using vibration fatigue analysis technique基于振动乏力分析技术的机械零部件乏力寿命评估
PREAI
分享收藏 没有更多内容
没有更多内容