A New Formalism of the Sliding Window Recursive Least Squares Algorithm and Its Fast Version

スポンサーリンク

概要

• 論文の詳細を見る

• A new compact form of the sliding window recursive least squares (SWRLS) algorithm, the I-SWRLS algorithm, is derived using an indefinite matrix. The resultant algorithm has a form similar to that of the traditional recursive least squares (RLS) algorithm, and is more computationally efficient than the conventional SWRLS algorithm including two Riccati equations. Furthermore, a computationally reduced version of the I-SWRLS algorithm is developed utilizing a shift property of the correlation matrix of input data. The resulting fast algorithm reduces the computational complexity from O(N2) to O(N) per iteration when the filter length (tap number) is N, but retains the same tracking performance as the original algorithm. This fast algorithm is much easier to implement than the existing SWC FTF algorithms.http://search.ieice.org/

• 2011-06-01

著者

• Nishiyama Kiyoshi

  Department Computer And Information Science Iwate University

• Nishiyama Kiyoshi

  Department Of Electrical Engineering And Computer Science Faculty Of Engineering Iwate University

関連論文

• Error Analysis and Numerical Stabilization of the Fast H_∞ Filter
• A Novel View of Color-Based Visual Tracker Using Principal Component Analysis
• Fast J-Unitary Array Form of the Hyper H_∞ Filter(Digital Signal Processing)
• 遠隔対話支援用LEDマイク一体型システム : 視覚フィードバックのユーザ行動に与える影響の分析
• Asymptotic Efficiency of Maximum Likelihood Estimation in Face Tracking Model Identification
• Nonlinear Estimation of Harmonic Signals(Digital Signal Processing)
• A New Formalism of the Sliding Window Recursive Least Squares Algorithm and Its Fast Version

スポンサーリンク