By Topic

A new algorithm for adaptive arrays

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)
Gardner, W.A. ; University of California, Davis, CA ; Brown, W.

A new deflected stochastic-gradient algorithm for adaptive sensor arrays is introduced. It is shown to have the capability of converging substantially faster than the nondeflected stochastic gradient (LMS) algorithm but slower than the recursive least squares (RLS) algorithm. Because of its amenability to reduction of computational complexity by data quantization, it has the potential for processing digital signals with bandwidths one to two orders of magnitude larger than the bandwidths manageable with the RLS algorithm for sensor arrays containing a number of adjustable weights in the approximate range of 10-50.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:35 ,  Issue: 9 )