A modified and parallelized Viterbi algorithm on hypercube machines

A Viterbi Algorithm is formally modified to select a set of k state sequences with top a posteriori probabilities, where k is a prespecified positive integer. A hypercube parallel algorithm is then developed along with a performance evaluation.

[1]  Frank K. Soong,et al.  A Tree.Trellis Based Fast Search for Finding the N Best Sentence Hypotheses in Continuous Speech Recognition , 1990, HLT.

[2]  Sargur N. Srihari,et al.  Integrating diverse knowledge sources in text recognition , 1982, TOIS.

[3]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[4]  N. Seshadri,et al.  Generalized Viterbi algorithms for error detection with convolutional codes , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[5]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[6]  Sargur N. Srihari,et al.  Recognition of handwritten and machine-printed text for postal address interpretation , 1993, Pattern Recognit. Lett..

[7]  G. V. Vstovsky,et al.  A class of hidden Markov models for image processing , 1993, Pattern Recognit. Lett..

[8]  M.-Y. Wu,et al.  Computer-aided programming for message-passing systems: problems and solutions , 1989, Proc. IEEE.

[9]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

[10]  Biing-Hwang Juang,et al.  Hidden Markov Models for Speech Recognition , 1991 .

[11]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[12]  R. Schwartz,et al.  The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypotheses , 1990, International Conference on Acoustics, Speech, and Signal Processing.