Regularization of the Affine Projection Algorithm

The affine projection algorithm (APA) is an attractive choice for echo cancellation, mainly for its convergence features. A matrix inversion is required within the APA. For practical reasons, this matrix needs to be regularized, i.e., a positive constant is added to the elements of its main diagonal. This regularization parameter is of great importance in practice since, if it is not chosen properly, the APA may never converge, especially under low-signal-to-noise-ratio conditions. In this brief, we propose a formula for choosing the value of the regularization parameter, aiming at attenuating the effects of the noise in the adaptive filter estimate. Simulations performed in an acoustic echo cancellation scenario prove the validity of the approach in different noisy environments.

[1]  Jacob Benesty,et al.  A Nonparametric VSS NLMS Algorithm , 2006, IEEE Signal Processing Letters.

[2]  Kazuhiko Ozeki,et al.  An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties , 1984 .

[3]  Steven L. Gay,et al.  The fast affine projection algorithm , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[4]  Isao Yamada,et al.  An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques , 2002, IEEE Trans. Signal Process..

[5]  Paulo Sergio Ramirez,et al.  Fundamentals of Adaptive Filtering , 2002 .

[6]  Wutao Yin,et al.  A Variable Regularization Method for Affine Projection Algorithm , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[7]  Young-Seok Choi,et al.  Adaptive Regularization Matrix for Affine Projection Algorithm , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[9]  Jacob Benesty,et al.  Variable Explicit Regularization in Affine Projection Algorithm: Robustness Issues and Optimal Choice , 2007, IEEE Transactions on Signal Processing.