Abstract

We introduce a sliding window adaptive RLS-like algorithm for filtering alpha-stable noise. Unlike previously introduced stochastic gradient-type algorithms, the new adaptation algorithm minimizes the L/sub p/ norm of the error exactly in a sliding window of fixed size. Therefore, it behaves much like the RLS algorithm in terms of convergence speed and computational complexity compared to previously introduced stochastic gradient-based algorithms, which behave like the LMS algorithm. It is shown that the new algorithm achieves superior convergence rate at the expense of increased computational complexity.

Full Text
Paper version not known

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 call

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.