By Topic

A speech recognizer with low complexity based on RNN

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
$33 $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

4 Author(s)
K. Kasper ; Inst. fur Angewandte Phys., Frankfurt Univ., Germany ; H. Reininger ; D. Wolf ; H. Wust

Speech recognition systems (SRS) designed for applications in low cost products, like telephones or in systems like autonomous vehicles, are faced with the demand for solutions with low complexity. A small vocabulary consisting of a few command words and the digits is sufficient for most of the applications but has to be recognized robustly. Here we report about investigations concerning the application of recurrent neural networks (RNN) for speaker independent recognition of speech signals with telephone bandwidth. An RNN-SRS with low complexity is developed which recognizes isolated words as well as connected digits in adverse conditions. We introduce locally recurrent neural networks (LRNN). LRNN are layered networks which have recurrent connections only between the neurons of a hidden layer and their n-nearest neighbours. The neurons of the input and the output layer have unidirectional and sparse connections to the hidden layer. In comparison to RNN the density of the connections is drastically reduced and long distance wiring could be avoided in VLSI realization

Published in:

Neural Networks for Signal Processing [1995] V. Proceedings of the 1995 IEEE Workshop

Date of Conference:

31 Aug-2 Sep 1995