Name
Abstract | ||
|---|---|---|
In this paper, we address the robustness, in the sense of l 2-stability, of the set-membership normalized least-mean-square (SM-NLMS) and the set-membership affine projection (SM-AP) algorithms. For the SM-NLMS algorithm, we demonstrate that it is robust regardless of the choice of its parameters and that the SM-NLMS enhances the parameter estimation in most of the iterations in which an update occurs, two advantages over the classical NLMS algorithm. Moreover, we also prove that if the noise bound is known, then we can set the SM-NLMS so that it never degrades the estimate. As for the SM-AP algorithm, we demonstrate that its robustness depends on a judicious choice of one of its parameters: the constraint vector (CV). We prove the existence of CVs satisfying the robustness condition, but practical choices remain unknown. We also demonstrate that both the SM-AP and SM-NLMS algorithms do not diverge, even when their parameters are selected naively, provided the additional noise is bounded. Numerical results that corroborate our analyses are presented. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1186/s13634-017-0507-7 | EURASIP J. Adv. Sig. Proc. |
Keywords | Field | DocType |
Adaptive filtering,Robustness,Set-theoretic estimation,Set-membership filtering,SM-NLMS,SM-AP | Mathematical optimization,Normalization (statistics),Adaptive filtering algorithm,Computer science,Algorithm,Robustness (computer science),Affine projection,Adaptive filter,Artificial intelligence,Estimation theory,Machine learning,Bounded function | Journal |
Volume | Issue | ISSN |
2017 | 1 | 1687-6180 |
Citations | PageRank | References |
2 | 0.37 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamed Yazdanpanah | 1 | 6 | 6.19 |
| Markus V. S. Lima | 2 | 57 | 11.75 |
| Paulo S. R. Diniz | 3 | 247 | 38.72 |