Abstract
The backward predictor based least squares (BPLS) algorithm, which is derived from the fast recursive least squares (FRLS) algorithms, demonstrates a very stable and robust numerical performance compared with the RLS and FRLS algorithms. However, the computational load of the BPLS algorithms is O(N/sup 2/). This makes it difficult to be implemented in real time applications even using today's DSP technology. In order to overcome this difficulty, a method for reducing the computational complexity of the BPLS algorithms is proposed. The result (we call it the fast BPLS algorithm) is consistent with the fast Newton transversal filters (FNTF) algorithms, but the derivation is much simpler to understand. The most important characteristic of the fast BPLS algorithm is its good numerical property. Theoretical analysis and computer simulations show that the fast BPLS algorithm provides a much improved numerical performance compared with the FNTF algorithms under a finite-precision implementation.
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.
