Abstract
This paper investigates the variable forgetting factor least squares method and establishes a nonlinear functional relationship between the forgetting factor and the error signal based on the Sigmoid function. The algorithm overcomes the conflict problem of steady-state performance and dynamic performance of the fixed forgetting factor RLS algorithm. The forgetting factor gradually increases during the gradual convergence of the algorithm, which ensures the algorithm’s steady-state performance while accelerating the algorithm’s tracking speed and convergence speed. At the same time, this paper also analyzes the rules of the parameters α and β and the effects of the parameters α and β on the performance of the RLS algorithm. Finally, computer simulations are conducted, and the results are consistent with the theoretical analysis, confirming that the algorithm outperforms the traditional RLS algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.