Chen, Boli;
Li, Peng;
Pin, Gilberto;
Fedele, Giuseppe;
Parisini, Thomas;
(2019)
Finite-time estimation of multiple exponentially-damped sinusoidal signals: A kernel-based approach.
Automatica
, 106
pp. 1-7.
10.1016/j.automatica.2019.04.016.
Preview |
Text
deadbeat_multi_sin_identification_short.pdf - Accepted Version Download (1MB) | Preview |
Abstract
The problem of estimating the parameters of biased and exponentially-damped multi-sinusoidal signals is addressed in this paper by a finite-time identification scheme based on Volterra integral operators. These parameters are the amplitudes, frequencies, initial phase angles, damping factors and the offset. The proposed strategy entails the design of a new kind of kernel function that, compared to existing ones, allows for the identification of the initial conditions of the signal-generator system. The worst-case behavior of the proposed algorithm in the presence of bounded additive disturbances is fully characterized by Input-to-State Stability arguments. Numerical examples including the comparisons with some existing tools are reported to show the effectiveness of the proposed methodology.
Type: | Article |
---|---|
Title: | Finite-time estimation of multiple exponentially-damped sinusoidal signals: A kernel-based approach |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1016/j.automatica.2019.04.016 |
Publisher version: | https://doi.org/10.1016/j.automatica.2019.04.016 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng |
URI: | https://discovery.ucl.ac.uk/id/eprint/10189799 |




Archive Staff Only
![]() |
View Item |