For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Numerical Perfomances of Recursive Least Squares and Predictor Based Least Squares: A Comparative Study
Youhua WANG Kenji NAKAYAMA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Digital Signal Processing
adaptive filter, RLS algorithm, fast RLS algorithm, stability, finite-precision implementation.,
Full Text: PDF>>
The numerical properties of the recursive least squares (RLS) algorithm and its fast versions have been extensively studied. However, very few investigations are reported concerning the numerical behavior of the predictor based least squares (PLS) algorithms that provide the same least squares solutions as the RLS algorithm. This paper presents a comparative study on the numerical performances of the RLS and the backward PLS (BPLS) algorithms. Theoretical analysis of three main instability sources reported in the literature, including the overrange of the conversion factor, the loss of symmetry and the loss of positive definiteness of the inverse correlation matrix, has been done under a finite-precision arithmetic. Simulation results have confirmed the validity of our analysis. The results show that three main instability sources encountered in the RLS algorithm do not exist in the BPLS algorithm. Consequently, the BPLS algorithm provides a much more stable and robust numerical performance compared with the RLS algorithm.