The most informative stopping times for Viterbi algorithm: sequential properties

Proceedings of 1994 Workshop on Information Theory and Statistics Pub Date : 1994-10-27 DOI:10.1109/WITS.1994.513916

J. Kogan

引用次数: 1

Abstract

Sequential properties of the Viterbi algorithm are studied based on a renewal sequence of the most informative stopping times which can be explicitly found during the Viterbi recognition of the most likeliest hidden Markovian state-sequence.

查看原文本刊更多论文

Viterbi算法最有信息量的停止时间:顺序属性

在对最有可能的隐马尔可夫状态序列进行Viterbi识别时，研究了Viterbi算法的序列特性，该算法基于一个具有最具信息量的停止时间的更新序列。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of 1994 Workshop on Information Theory and Statistics

自引率

0.00%

发文量