By Topic

Time-delay neural networks, volterra series, and rates of approximation

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

1 Author(s)
Sandberg, I.W. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

We consider a large family of approximately-finite memory causal time-invariant maps G from an input set S to a set of IR-valued functions, with the members of both sets of functions defined on the nonnegative integers, and we give an upper bound on the error in approximating a G using a two-stage structure consisting of a tapped delay line followed by a static neural network. As an application, information is given concerning the long-standing problem of determining the order of a Volterra-series approximation so that a given quality of approximation can be achieved. We have also obtained a corresponding result for the approximation of not-necessarily-causal input-output maps with inputs and outputs that may depend on more than one variable. These results are of interest, for example, in connection with image processing

Published in:

Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on  (Volume:3 )

Date of Conference:

31 May-3 Jun 1998