DocumentCode :
3058379
Title :
Constant-gain filters for finite shift-rank processes
Author :
Delosme, J.-M. ; Morf, M.
Author_Institution :
Stanford University, Stanford, CA
Volume :
7
fYear :
1982
fDate :
30072
Firstpage :
1732
Lastpage :
1735
Abstract :
On-line identification methods for dynamic systems traditionally assume given-order rational models. The class of finite shift-rank processes includes processes with rational models of arbitrary order and, if the observed process is approximated by a finite shift-rank process, the determination of the model order becomes a natural part of the identification procedure. The Fast Cholesky and Extended Levinson algorithms exploit the finite shift-rank structure in order to compute the time-varying coefficients of the growing-order modeling/whitening filters of finite shift-rank processes. The recursions performed by the algorithms suggest that the growing-order filters may also be implemented in a modular fashion where the modules have constant coefficients, thus displaying the structural invariants. Such a modular filtering structure is presented in this paper.
Keywords :
Covariance matrix; Delay lines; Eigenvalues and eigenfunctions; Feedforward systems; Filtering; Filters; Technological innovation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.
Type :
conf
DOI :
10.1109/ICASSP.1982.1171813
Filename :
1171813
Link To Document :
بازگشت