2000 character limit reached
L2-Stability Analysis of the SM-NLMS Algorithm
Published 11 Jan 2020 in eess.SP | (2001.03616v1)
Abstract: In this letter, we analyze, two properties, the local and the global robustness of the set-membership normalized least mean square (SM-NLMS) algorithm. We will show that the SM-NLMS algorithm has l2-stability. Indeed, the SM-NLMS algorithm never diverges; no matter how the parameters of the SM-NLMS algorithm has been selected. Ultimately, the numerical simulations corroborate the validity of our analysis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.