Abstract
A convergent algorithm for l/sub 1/ robust identification of a stable rational transfer function with known order is proposed, which is implemented by solving a linear programming problem and can produce a rational transfer function with a fixed order. An explicit upper bound on its worst case identification error is given. Its performance is proven to be close to that of an interpolation algorithm if a high-order Galois sequence is taken as the input signal.
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.
