Abstract
A recursive identification algorithm based on extended least squares is proposed to deal with the contingency of overparametrization. The algorithm is relatively simple compared to those involving online order determination, being based on adaptively introducing suitable excitation into the algorithm to avoid ill-conditioning. In the case of extended-least-squares-based adaptive estimation, then the regressors are appropriately stochastically perturbed. The algorithm is shown to converge to a uniquely defined signal model with any pole-zero cancellations at the origin.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
