Skip to main content
Article thumbnail
Location of Repository

Speech Recognition on an FPGA Using Discrete and Continuous Hidden Markov Models

By Stephen Jonathan Melnikoff, Steven Francis Quigley and Martin Russell


Speech recognition is a computationally demanding task, particularly the stage which uses Viterbi decoding for converting pre-processed speech data into words or sub-word units. Any device that can reduce the load on, for example, a PC’s processor, is advantageous. Hence we present FPGA implementations of the decoder based alternately on discrete and continuous hidden Markov models (HMMs) representing monophones, and demonstrate that the discrete version can process speech nearly 5,000 times real time, using just 12% of the slices of a Xilinx Virtex XCV1000, but with a lower recognition rate than the continuous implementation, which is 75 times faster than real time, and occupies 45% of the same device

Topics: TK Electrical engineering. Electronics Nuclear engineering, QA75 Electronic computers. Computer science
Publisher: Springer Verlag
Year: 2002
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.