Abstract
A new algorithm is developed, which guarantees the normalized bias in the weight vector due to persistent and bounded data perturbations to be bounded. Robustness analysis for this algorithm has been presented. An approximate recursive implementation is also proposed. It is termed as the robust recursive least squares (RRLS) algorithm since it resembles the RLS algorithm in its structure and is robust with respect to persistent bounded data perturbation. Simulation results are presented to illustrate the efficacy of the RRLS algorithm.
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.
