Improved Quasi-Newton Adaptive-Filtering Algorithm

An improved quasi-Newton (QN) algorithm that performs data-selective adaptation is proposed whereby the weight vector and the inverse of the input-signal autocorrelation matrix are updated only when the a priori error exceeds a prespecified error bound. The proposed algorithm also incorporates an improved estimator of the inverse of the autocorrelation matrix. With these modifications, the proposed QN algorithm takes significantly fewer updates to converge and yields a reduced steady-state misalignment relative to a known QN algorithm proposed recently. These features of the proposed QN algorithm are demonstrated through extensive simulations. Simulations also show that the proposed QN algorithm, like the known QN algorithm, is quite robust with respect to roundoff errors introduced in fixed-point implementations.

[1]  Andreas Antoniou,et al.  A new quasi-Newton adaptive filtering algorithm , 1997 .

[2]  A.A. Rontogiannis,et al.  New fast inverse QR least squares adaptive algorithms , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

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

[4]  W. Kenneth Jenkins,et al.  A fast quasi-Newton adaptive filtering algorithm , 1992, IEEE Trans. Signal Process..

[5]  Andreas Antoniou,et al.  Analysis of LMS-Newton adaptive filtering algorithms with variable convergence factor , 1995, IEEE Trans. Signal Process..

[6]  T. Kailath,et al.  Fast, recursive-least-squares transversal filters for adaptive filtering , 1984 .

[7]  Stefan Werner,et al.  Set-membership binormalized data-reusing LMS algorithms , 2003, IEEE Trans. Signal Process..

[8]  Andreas Antoniou,et al.  A robust quasi-Newton adaptive filtering algorithm , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[9]  Bin Yang,et al.  Rotation-based RLS algorithms: unified derivations, numerical properties, and parallel implementations , 1992, IEEE Trans. Signal Process..

[10]  K. Narendra,et al.  Bounded error adaptive control , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[11]  S. Thomas Alexander,et al.  A Method for Recursive Least Squares Filtering Based Upon an Inverse QR Decomposition , 1993, IEEE Trans. Signal Process..

[12]  Bertram E. Shi,et al.  IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS — I : REGULAR PAPERS , VOL . ? ? , NO . ? ? , ? ? ? ? , 2007 .

[13]  L. Ljung,et al.  Fast calculation of gain matrices for recursive estimation schemes , 1978 .

[14]  John M. Cioffi,et al.  The fast adaptive ROTOR's RLS algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

[15]  George Carayannis,et al.  A fast sequential algorithm for least-squares filtering and prediction , 1983 .

[16]  R. Fletcher Practical Methods of Optimization , 1988 .

[17]  George Carayannis,et al.  A unifed view of parametric processing algorithms for prewindowed signals , 1986 .

[18]  Paulo S. R. Diniz,et al.  Adaptive Filtering: Algorithms and Practical Implementation , 1997 .

[19]  Phillip A. Regalia,et al.  On the numerical stability and accuracy of the conventional recursive least squares algorithm , 1999, IEEE Trans. Signal Process..

[20]  Dirk T. M. Slock Reconciling fast RLS lattice and QR algorithms , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[21]  J. G. McWhirter,et al.  Fast algorithms for least squares linear prediction based on orthogonal rotations , 1989 .

[22]  Brian Borchers,et al.  Review of practical optimization: algorithms and engineering applications by Andreas Antoniou and Wu-Sheng Lu (Springer Verlag, 2007) , 2009, SIGA.

[23]  Phillip A. Regalia,et al.  On the duality between fast QR methods and lattice methods in least squares adaptive filtering , 1991, IEEE Trans. Signal Process..

[24]  Shing-Chow Chan,et al.  A robust quasi-Newton adaptive filtering algorithm for impulse noise suppression , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).