By Topic

Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis

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)
Markus Rupp ; Institute of Telecommunications, Vienna University of Technology, Vienna, Austria

The so-called Affine Projection (AP) algorithm is of large interest in many adaptive filters applications due to its considerable speed-up in convergence compared to its simpler version, the LMS algorithm. While the original AP algorithm is well understood, gradient type variants of less complexity with relaxed step-size conditions called pseudo affine projection offer still unresolved problems. This contribution shows i) local robustness properties of such algorithms, ii) global properties of these, concluding ℓ2-stability conditions that are independent of the input signal statistics, as well as iii) steady-state values of moderate to high accuracy by relatively simple terms when applied to long filters. Of particular interest is the existence of lower step-size bounds for one of the variants, a bound that has not been observed before.

Published in:

IEEE Transactions on Signal Processing  (Volume:59 ,  Issue: 5 )