Abstract
A generalized inverse approach is used to derive two fast adaptive recursive least squares (RLS) algorithms and an exact and stable initialization algorithm for the prewindowed signal case. The partitioning techniques are directly applied to the signal matrix rather than the covariance matrix. The simulations show that the method has better numerical properties than existing fast algorithms, especially when the Kalman gain is concerned. Interesting relations among the variables in the fast RLS algorithms are provided. These relations can be used to derive other variations of fast RLS algorithms. They can also be used to develop new rescue schemes. Finally, a numerical analysis illustrates some pitfalls of the fast RLS algorithms.< <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.
