Abstract
In this paper, two simple subspace-based identification algorithms to identify stable linear-time-invariant systems from corrupted phase samples of frequency response function are developed. The first algorithm uses data sampled at nonuniformly spaced frequencies and is strongly consistent if corruptions are zero-mean additive random variables with a known covariance function. However, this algorithm is biased when corruptions are multiplicative, yet it exactly retrieves finite-dimensional systems from noise-free phase data using a finite amount of data. The second algorithm uses phase data sampled at equidistantly spaced frequencies and also has the same interpolation and strong consistency properties if corruptions are zero-mean additive random variables. The latter property holds also for the multiplicative noise model provided that some noise statistics are known a priori. Promising results are obtained when the algorithms are applied to simulated data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
