Abstract
In this paper, we present an algorithm for estimating poles of linear time-invariant systems by using the backward shift operator. We prove that poles of rational functions, including zeros and multiplicities, are solutions to an algebraic equation which can be obtained by taking backward shift operator to the shifted Cauchy kernels in the unit disc case. The algorithm is accordingly developed for frequency-domain identification. We also prove the robustness of this algorithm. Some illustrative examples are presented to show the efficiency in systems with distinguished and multiple poles.
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.
