By Topic

Optimal convergence factor for Gauss-Newton algorithms and its application to an adaptive parallel realization

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

2 Author(s)
Diniz, P.S.R. ; Programa de Eng. Eletrica, Univ. Federal do Rio de Janeiro, Brazil ; Cousseau, J.E.

An efficient approach for the calculation of the optimal convergence factor for Gauss-Newton algorithms is proposed. The method leads to variable step size (convergence factor) algorithms that yield fast convergence, with an acceptable added cost in computational complexity. The results are applied to a recently proposed frequency-domain parallel realization for an adaptive IIR (infinite impulse response) filter, and evaluated in systems identification applications. Simulations confirm the expected results

Published in:

Telecommunications Symposium, 1990. ITS '90 Symposium Record., SBT/IEEE International

Date of Conference:

3-6 Sep 1990