Blind identification of an autoregressive system using a nonlinear dynamical approach (Q2734412)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Blind identification of an autoregressive system using a nonlinear dynamical approach |
scientific article; zbMATH DE number 1634019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Blind identification of an autoregressive system using a nonlinear dynamical approach |
scientific article; zbMATH DE number 1634019 |
Statements
Blind identification of an autoregressive system using a nonlinear dynamical approach (English)
0 references
13 July 2003
0 references
chaos
0 references
inverse filtering
0 references
nonlinear dynamics
0 references
system identification
0 references
universal estimator
0 references
autoregressive system
0 references
complexity measure
0 references
phase space volume
0 references
The problem of identifying an autoregressive (AR) system with arbitrary driven noise is considered here. Using an abstract dynamical system to represent both chaotic and stochastic processes in a unified framework, a dynamic-based complexity measure called phase space volume (PSV), which has its origins in chaos as well as stochastic environments, can be applied to identify an AR model in chaotic as well as stochastic noise environments. It is shown that the PSV of the output signal of an inverse filter applied to identify an AR model is always larger than the PSV of the output signal of the AR system. Therefore, by minimizing the PSV of the inverse output, one can estimate the coefficients and the order of the AR system. A major advantage of this minimum-phase space volume identification technique is that it works like a universal estimator that does not require precise statistical information about the AR input signal. Because the theoretical PSV is so difficult to compute, two approximations of PSV are also considered: the e-PSV and nearest neighbor PSV. Both approximations are shown to approach the ideal PSV asymptotically. The identification performance based on these two approximations are evaluated using Monte Carlo simulation. Both approximations are found to generate relatively good results in identifying an AR system in various noise environments, including chaotic, non-Gaussian, and colored noise.
0 references