DocumentCode :
866908
Title :
Continuous-time recursive least-squares algorithms
Author :
Huarng, Keh-Chiarng ; Yeh, Chien-chung
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume :
39
Issue :
10
fYear :
1992
fDate :
10/1/1992 12:00:00 AM
Firstpage :
741
Lastpage :
745
Abstract :
Two continuous-time recursive least-squares (RLS) algorithms are derived in this work in a unified approach, one for the Gramm-Schmidt orthogonalization (GSO) of multiple signals and the other for the lattice filter with time-shifted data. The GSO algorithm is derived in the continuous-time domain directly in the sense of the exact minimization of integral-squared-error. Then, the lattice algorithm can be obtained by applying the developed GSO to the updates of the forward and backward predictions of time-shifted data. The two algorithms are highly modular and use the same kind of module. Unlike the discrete-time RLS algorithms, no extra parameters are required to link the modules, and each module performs independently a standard order-one continuous-time RLS weight update using its present local information of the inputs and the feedback of the output
Keywords :
filtering and prediction theory; least squares approximations; signal processing; GSO algorithm; Gramm-Schmidt orthogonalization; backward predictions; continuous-time recursive least-squares; exact minimization; feedback; forward prediction; integral-squared-error; lattice filter; multiple signals; time-shifted data; Adaptive arrays; Adaptive signal processing; Delay; Lattices; Minimization methods; Output feedback; Resonance light scattering; Signal processing; Signal processing algorithms; Transversal filters;
fLanguage :
English
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7130
Type :
jour
DOI :
10.1109/82.199900
Filename :
199900
Link To Document :
بازگشت