A LIST-TYPE REDUCED-CONSTRAINT GENERALIZATION OF THE VITERBI ALGORITHM

被引:82
作者
HASHIMOTO, T
机构
关键词
D O I
10.1109/TIT.1987.1057377
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:866 / 876
页数:11
相关论文
共 17 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]   REAL-NUMBER CONVOLUTIONAL CODES FOR SPEECH-LIKE QUASI-STATIONARY SOURCES [J].
ANDERSON, JB ;
LAW, CW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (06) :778-782
[3]   TREE ENCODING OF SPEECH [J].
ANDERSON, JB ;
BODIE, JB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :379-387
[4]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[5]  
FORNEY GD, 1974, INFORM CONTROL, V25, P222, DOI 10.1016/S0019-9958(74)90870-5
[6]   REDUCED STATE VARIANT OF MAXIMUM LIKELIHOOD SEQUENCE DETECTION ATTAINING OPTIMUM PERFORMANCE FOR HIGH SIGNAL-TO-NOISE RATIOS [J].
FOSCHINI, GJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (05) :605-609
[7]  
GALLAGER RG, 1968, INFORMATION THEORY R
[8]   GENERALIZED STACK ALGORITHMS FOR DECODING CONVOLUTIONAL CODES [J].
HACCOUN, D ;
FERGUSON, MJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (06) :638-651
[9]  
HASHIMOTO T, 1979, IEEE T INFORM THEORY, V25, P584, DOI 10.1109/TIT.1979.1056085
[10]  
Jelinek F., 1968, PROBABILISTIC INFORM