By Topic

Algorithms and architectures for dynamic programming on Markov chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bliss, W.G. ; Dept. of Electr. Eng., Colorado Univ., Boulder, CO, USA ; Scharf, L.L.

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

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:37 ,  Issue: 6 )