A list-type reduced-constraint generalization of the Viterbi algorithm
A list-type reduced-constraint generalization of the Viterbi algorithm
复制标题
维特比算法的列表型简化约束推广
DOI：
--
复制
发表时间：
1987
影响因子：
2.5
通讯作者：
T. Hashimoto
中科院分区：
文献类型：
--
作者：
T. Hashimoto
Viterbi算法（VA）是一种针对约束长度为K的Q元格码的最佳解码规则，它通过在每个解码步骤中从Q^{K-1}个候选列表中取最佳幸存者来操作。提出了一种基于长度为L（Lleq K）的标签进行比较的广义方差分析（GVA）。它结合列表解码的概念，从每个解码步骤的Q^{L-1}个候选列表中选择S个最佳幸存者。证明了离散无记忆信道的编码定理，并证明了这些定理是对离散无记忆信道编码定理的自然推广。最后给出了一个符号间干扰去除的例子，以说明GVA可以提供的实际好处。
The Viterbi algorithm (VA), an optimum decoding rule for a Q -ary trellis code of constraint length K , operates by taking the best survivor from each of Q^{K-1} lists of candidates at each decoding step. A generalized VA (GVA) is proposed that makes comparisons on the basis of a label of length L(Lleq K) . It selects, incorporating the notion of list decoding, the S best survivors from each of Q^{L-1} lists of candidates at each decoding step. Coding theorems for a discrete memoryless channel are proved for GVA decoding and shown to be natural generalizations of those for VA decoding. An example of intersymbol interference removal is given to illustrate the practical benefits that the GVA can provide.