Abstract
Lattice algorithms are a numerically efficient implementation of recursive identification methods. Due to an orthogonalizing basis transformation in the regressor space, they provide model estimates of several orders simultaneously, which makes them well-suited for adaptive control applications. Up to now lattice algorithms were only available for AR(X) and ARMA models. In this paper lattice algorithms are proposed for general model structures, with simplifications for ARMAX and OE models. Simulation studies show that the proposed lattice algorithms have better convergence than nonlattice implementations of recursive identification. Since also the number of computations is less, application of these algorithms in adaptive control seems very promising.
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.
