Continuous real-time speech recognition is a highly computationallydemanding task, but one which can take good advantage of a parallel processing system. To this end, we describe proposals for, and preliminary findings of, research in implementing in programmable logic the decoder part of a speech recognition system. Recognition via Viterbi decoding of Hidden Markov Models is outlined, along with details of current implementations, which aim to exploit properties of the algorithm that could make it well-suited for devices such as FPGAs. The question of how to deal with limited resources, by reconfiguration or otherwise, is also addressed.
CITATION STYLE
Melnikoff, S. J., James-Roxby, P. B., Quigley, S. F., & Russell, M. J. (2000). Reconfigurable computing for speech recognition: Preliminary findings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 495–504). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_54
Mendeley helps you to discover research relevant for your work.