By Topic

On closed-loop adaptive noise cancellation

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)
Kushner, H.J. ; Div. of Appl. Math., Brown Univ., Providence, RI, USA

Given the mean limit ordinary differential equation for the stochastic approximation defining the adaptive algorithm for a closed-loop adaptive noise cancellation, we characterize the limit points. Under appropriate conditions, it is shown that as the dimension of the weight vector increases, the sequence of corresponding limit points converges in the sense of l2 to the infinite-dimensional optimal weight vector. Also, the limit point of the algorithm is nearly optimal if the dimension of the weight vector is large enough. The gradient of the mean-square error with respect to the weight vector, evaluated at the limit, goes to zero in l1 and l2 as the dimension increases, as does the gradient with respect to the coefficients in the transfer function connecting the reference noise signal with the error output. Thus the algorithm is “nearly” a gradient descent algorithm and is error-reducing for large enough dimension. Under broad conditions, iterative averaging can be used to get a nearly optimal rate of convergence

Published in:

Automatic Control, IEEE Transactions on  (Volume:43 ,  Issue: 8 )