Title :
Algorithms and architectures for dynamic programming on Markov chains
Author :
Bliss, William G. ; Scharf, Louis L.
Author_Institution :
Dept. of Electr. Eng., Colorado Univ., Boulder, CO, USA
fDate :
6/1/1989 12:00:00 AM
Abstract :
Algorithms and architectures are developed for dynamic programming on finite-state Markov chains. The results are applied to phase tracking of a phase-jitter carrier, Viterbi decoding of convolutional codes, and isolated-word recognition using hidden Markov models and dynamic time warping. It is argued that a computing ring, which is really a cyclic systolic array of cells, provides a good tradeoff between performance and complexity for implementation in VLSI. The computing ring may be pipelined with a preprocessor and a memory management unit to achieve a modular design
Keywords :
Markov processes; VLSI; computerised signal processing; dynamic programming; parallel algorithms; parallel architectures; VLSI; Viterbi decoding; architectures; computerised signal processing; convolutional codes; cyclic systolic array; dynamic programming; dynamic time warping; finite-state Markov chains; hidden Markov models; isolated-word recognition; parallel processing; phase tracking; phase-jitter carrier; Computer architecture; Deconvolution; Delay estimation; Dynamic programming; Hidden Markov models; Maximum likelihood decoding; Phase estimation; Systolic arrays; Very large scale integration; Viterbi algorithm;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
DOI :
10.1109/ASSP.1989.28061