Affine Projection Adaptive Filter with Variable Regularization

Authors: Young-Seok Choi

Abstract:

We propose two affine projection algorithms (APA) with variable regularization parameter. The proposed algorithms dynamically update the regularization parameter that is fixed in the conventional regularized APA (R-APA) using a gradient descent based approach. By introducing the normalized gradient, the proposed algorithms give birth to an efficient and a robust update scheme for the regularization parameter. Through experiments we demonstrate that the proposed algorithms outperform conventional R-APA in terms of the convergence rate and the misadjustment error.

Keywords: Affine projection, regularization, gradient descent, system identification.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1112019

References:

[1] B. Widrow and S. D. Sterns, Adaptive Signal Processing, Englewood Cliffs, NJ: Prentice Hall, 1985.
[2] S. Haykin, Adaptive Filter Theory, Englewood Cliffs, NJ: Prentice Hall, 2002.
[3] A. H. Sayed, Fundamentals of Adaptive Filtering, Englewood Cliffs, NJ: Prentice Hall, 2003.
[4] K. Ozeki and T. Umeda, “An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties,” Electro. Commun. Jpn., vol. 67-A, no. 5, pp. 19–27, 1984.
[5] H.-C. Shin and A. H. Sayed, “Mean-square peformance of a family of affine projection algorithms,” IEEE Trans. Signal Processing, vol. 52, pp. 90–102, Jan. 2004.
[6] V. Myllyl¨a and G. Schmidt, “Psedo-optimal regulariztion for affine projection algorithms,” in Proc. IEEE Int. Conf. on Accoustics, Speech, and Signal Processing, ICASSP’02, Orlando, Florida, May 2002, pp. 1917–1920.
[7] S. C. Douglas, “Generalized gradient adaptive step sizes for stochastic gradient adaptive filters,” in Proc. IEEE Int. Conf. on Accoustics, Speech, and Signal Processing, ICASSP’95, vol. 2, pp. 1396–1399, 1995.