DocumentCode :
830947
Title :
The KaGE RLS algorithm
Author :
Skidmore, Ian D. ; Proudler, Ian K.
Author_Institution :
QinetiQ Ltd., Malvern, UK
Volume :
51
Issue :
12
fYear :
2003
Firstpage :
3094
Lastpage :
3104
Abstract :
A new fast recursive least squares (RLS) algorithm, the Kalman gain estimator (KaGE), is introduced. By making use of RLS interpolation as well as prediction, the algorithm generates the transversal filter weights without suffering the poor numerical attributes of the fast transversal filter (FTF) algorithm. The Kalman gain vector is generated at each time step in terms of interpolation residuals. The interpolation residuals are calculated in an order recursive manner. For an Nth-order problem, the procedure requires O(Nlog2N) operations per iteration. This is achieved via a divide-and-conquer approach. Computer simulations suggest that the new algorithm is numerically robust, running successfully for many millions of iterations.
Keywords :
adaptive filters; divide and conquer methods; filtering theory; interpolation; iterative methods; least squares approximations; parameter estimation; prediction theory; recursive estimation; Kalman gain estimator; Kalman gain vector; RLS algorithm; adaptive filtering algorithms; divide-and-conquer approach; interpolation residuals; iterations; order recursive manner; recursive least squares algorithm; transversal filter weights; Adaptive filters; Computational efficiency; Convergence; Filtering algorithms; Interpolation; Least squares approximation; Least squares methods; Noise cancellation; Resonance light scattering; Transversal filters;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2003.818997
Filename :
1246516
Link To Document :
بازگشت