Computationally efficient locally-recurrent neural networks for online signal processing

Citation

Hussain A, Soraghan JJ & Shim I (1999) Computationally efficient locally-recurrent neural networks for online signal processing. In: 9th International Conference on Artificial Neural Networks: ICANN '99. Conference Proceedings, 470. 9th International Conference on Artificial Neural Networks: ICANN '99, Edinburgh, 07.09.1999-10.09.1999. Piscataway, NJ: IEEE, pp. 684-689. http://digital-library.theiet.org/content/conferences/10.1049/cp_19991190; https://doi.org/10.1049/cp%3A19991190

Abstract
A general class of computationally efficient locally recurrent networks (CERN) is described for real-time adaptive signal processing. The structure of the CERN is based on linear-in-the-parameters single-hidden-layered feedforward neural networks such as the radial basis function (RBF) network, the Volterra neural network (VNN) and the functionally expanded neural network (FENN), adapted to employ local output feedback. The corresponding learning algorithms are derived and key structural and computational complexity comparisons are made between the CERN and conventional recurrent neural networks. Two case studies are performed involving the real-time adaptive nonlinear prediction of real-world chaotic, highly non-stationary laser time series and an actual speech signal, which show that a recurrent FENN based adaptive CERN predictor can significantly outperform the corresponding feedforward FENN and conventionally employed linear adaptive filtering models.