Abstract
Adaptive Fourier decomposition (AFD) method was used in system identification in recent years. This algorithm is a greedy technique of approximation, it is to find fast approximations by selecting basis functions. In this paper, a continue work is presented to study the two-step algorithm developed for identification of linear time-invariant systems by using AFD algorithm. The first step in the two-step algorithm is modified, where polynomials are used to replace Cauchy formula. Analysis shows the robustness is kept. The effectiveness of new improvement is shown through an example.
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.
