An FPGA implementation of speech recognition with weighted finite state transducers

Citations Over TimeTop 10% of 2010 papers

Abstract

In this paper we present a hardware architecture for large vocabulary continuous speech recognition that conducts a search over a weighted finite state transducer (WFST) network. A pipelined architecture is proposed to fully utilize the memory bandwidth. A hash table is used to manage small sized working sets efficiently. We also applied a parallelization technique that increases the traversal speed by 17%. The recognition system is fully functional on an FPGA, which runs at 100MHz. The experimental result on the Wall Street Journal 5,000 vocabulary task shows that the recognition speed of the system is 5.3× faster than real-time.

Related Papers

• → Locality-sensitive hashing scheme based on dynamic collision counting(2012)224 cited
• → Algorithms for approximate FSM traversal based on state space decomposition(1996)80 cited
• → An efficient approach for the maintenance of path traversal patterns(2004)8 cited
• → An Incremental Updating Technique for Discovering Frequent Traversal Patterns(2004)2 cited
• → Evolutionary algorithm approach for symbolic FSM traversals(2002)1 cited