By Topic

A family of adaptive filter algorithms with decorrelating properties

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
$33 $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)
M. Rupp ; Wireless Res. Lab., AT&T Bell Labs., Holmdel, NJ, USA

Although the normalized least mean square (NLMS) algorithm is robust, it suffers from low convergence speed if driven by highly correlated input signals. One method presented to overcome this problem is the Ozeki/Umeda (1984) affine projection (AP) algorithm. The algorithm applies update directions that are orthogonal to the last P input vectors and thus allows decorrelation of an AR(P) input process, speeding up the convergence. This article presents a simple approach to show this property, which furthermore leads to the construction of new algorithms that can handle other kinds of correlations such as MA and ARMA processes. A statistical analysis is presented for this family of algorithms. Similar to the AP algorithm, these algorithms also suffer a possible increase in the noise energy caused by their pre-whitening filters

Published in:

IEEE Transactions on Signal Processing  (Volume:46 ,  Issue: 3 )