Discrete Recurrent Neural Networks

Part of the Network Theory and Applications book series (NETA, volume 13)


Generally, a discrete time RNN can be described by the difference system model
$$ x(k + 1) = F(x(k)) $$
where x ∈ R n , F : R n → R n is a mapping which can be bounded or unbounded. By suitably selecting the mapping F in (8.1), various classes of discrete RNNs can be obtained.


Equilibrium Point Convergence Analysis Recurrent Neural Network Cellular Neural Network Complete Convergence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2004

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengduPeople’s Republic of China
  2. 2.Department of Electrical and Computer EngineeringThe National University of SingaporeSingapore

Personalised recommendations