Reconfigurable Computing for Speech Recognition: Preliminary Findings

  • S. J. Melnikoff
  • P. B. James-Roxby
  • S. F. Quigley
  • M. J. Russell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1896)

Abstract

Continuous real-time speech recognition is a highly computationally-demanding 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alexandres, S., Moran, J., Carazo, J. & Santos, A., “Parallel architecture for real-time speech recognition in Spanish,” Proc. IEEE International Conference On Acoustics, Speech And Signal Processing (ICASSP’ 90), 1990, pp. 977–980.Google Scholar
  2. 2.
    Cox, S.J., “Hidden Markov models for automatic speech recognition: theory and application,” British Telecom Technology Journal, 6, No. 2, 1988, pp. 105–115.Google Scholar
  3. 3.
    Kimball, O., Cosell, L., Schwarz, R. & Krasner, M., “Efficient implementation of continuous speech recognition on a large scale parallel processor,” Proc. IEEE International Conference On Acoustics, Speech And Signal Processing (ICASSP’ 87), 1987, pp. 852–855.Google Scholar
  4. 4.
    Mitchell, C.D., Harper, M.P., Jamieson, L.H. & Helzerman, R.A., “A parallel implementation of a hidden Markov model with duration modeling for speech recognition,” Digital Signal Processing, 5, No. 1, 1995, pp. 43–57 and http://purcell.ecn.purdue.edu/~speechg/ CrossRefGoogle Scholar
  5. 5.
    James-Roxby, P.B. & Blodget, B., “Adapting constant multipliers in a neural network implementation,” to appear in: Proc. IEEE Symposium on FPGAs for Custom Computing Machines (FCCM 2000), 2000.Google Scholar
  6. 6.
    Levinson, S.E., “Continuously variable duration hidden Markov models for automatic speech recognition,” Computer Speech and Language, 1986, 1, pp. 29–45.CrossRefGoogle Scholar
  7. 7.
    Murveit, H. et al, “Large-vocabulary real-time continuous-speech recognition system,” Proc. IEEE International Conference On Acoustics, Speech And Signal Processing (ICASSP’ 89), 1989, pp. 789–792.Google Scholar
  8. 8.
    Rabiner, L.R., “A tutorial on hidden Markov models and selected applications in speech recognition,” Proceedings of the IEEE, 77, No. 2, 1989, pp. 257–286 and Waible, A. & Lee, K.F. (eds.), Readings in Speech Recognition, 1990, Morgan Kaufmann Publishers, Inc., pp.267–296.CrossRefGoogle Scholar
  9. 9.
    Roe, D.B., Gorin, A.L. & Ramesh, P. “Incorporating syntax into the level-building algorithm on a tree-structured parallel computer,” Proc. IEEE International Conference On Acoustics, Speech And Signal Processing (ICASSP’ 89), 1989, pp. 778–781.Google Scholar
  10. 10.
    Sutherland, A.M., Campbell, M., Ariki, Y. & Jack, M.A., “OSPREY: a transputer based continuous speech recognition system,” Proc. IEEE International Conference On Acoustics, Speech And Signal Processing (ICASSP’ 90), 1990, pp. 949–952.Google Scholar
  11. 11.
    Young, S., “A review of large-vocabulary continuous-speech recognition,” IEEE Signal Processing Magazine, 13, No. 5, 1996, pp. 45–57.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • S. J. Melnikoff
    • 1
  • P. B. James-Roxby
    • 2
  • S. F. Quigley
    • 1
  • M. J. Russell
    • 1
  1. 1.School of Electronic and Electrical EngineeringUniversity of BirminghamEdgbastonUK
  2. 2.Xilinx, IncBoulderUSA

Personalised recommendations