Numerical performances of recursive least squares and predictor based least squares: A comparative study
スポンサーリンク
概要
- 論文の詳細を見る
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 over-range 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.
- 社団法人電子情報通信学会の論文
- 1997-04-25
著者
-
Wang Youhua
Faculty Of Engineering Kanazawa University
-
Nakayama Kenji
Faculty Of Engineering Kanazawa University
関連論文
- Convergence Analysis and a Synchronized Learning Algorithm for a Joint Lattice Predictor and FIR Adaptive Filter
- Numerical performances of recursive least squares and predictor based least squares: A comparative study
- Automatic tap assignment in sub-band adaptive filter
- A new structure for noise and echo cancelers based on a combined fast adaptive filter algorithm
- Optimum order assignment on numerator and denominator for IIR adaptive filters adjusted by equation error