Set-membership adaptive filtering
From MaRDI portal
This contribution provides an overview of set-membership adaptive filtering (SMAF). It illustrates the main ideas of this filtering technique as well as its properties and applications. In particular, two classes of SMAF algorithms are examined, the optimal bounding ellipsoid (OBE) and the set-membership normalized least-mean-squares (SM-NLMS) algorithms. Their features, in particular selective update of parameter estimates and robust filtering performance, are discussed. For the entire collection see [Zbl 1023.00012].
Recommendations
- Convergence performance of the simplified set-membership affine projection algorithm
- Selective partial update and set-membership subband adaptive filters
- Adaptive filtering. Algorithms and practical implementation
- scientific article; zbMATH DE number 2094674
- A new kernel RLS algorithm for systems with bounded noise
Cited in
(7)- Selective partial update and set-membership subband adaptive filters
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- A nonlinear set-membership filter for on-line applications
- Set membership approach for reducing value sets in the frequency domain
- A new kernel RLS algorithm for systems with bounded noise
- Rethinking the Mathematical Framework and Optimality of Set-Membership Filtering
- Convergence performance of the simplified set-membership affine projection algorithm
This page was built for publication: Set-membership adaptive filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736131)
