A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis
From MaRDI portal
Publication:5354063
DOI10.1109/TSP.2004.823496zbMATH Open1369.94107OpenAlexW2150709895MaRDI QIDQ5354063FDOQ5354063
Authors: Shing-Chow Chan, Yuexian Zou 
Publication date: 8 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2004.823496
Cited In (12)
- A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering
- New polynomial approach to myriad filter computation
- Combination of Recursive Least $p$-Norm Algorithms for Robust Adaptive Filtering in Alpha-Stable Noise
- A novel robust MM filter against outliers
- Robust multitask diffusion normalized M-estimate subband adaptive filter algorithm over adaptive networks
- Sequential and adaptive learning algorithms for M-estimation
- A robust regression framework with Laplace kernel-induced loss
- Delay-dependent robust \(H _{\infty }\) filter design for uncertain linear systems with time-varying delay
- Recursive least mean \(p\)-power extreme learning machine
- Robust diffusion recursive least M-estimate adaptive filtering and its performance analysis
- Perception-based \(\ell _p\)-norm minimization approach for nonlinear system identification in GGD noise
- Exponential myriad smoothing algorithm for robust signal processing in \(\alpha \)-stable noise environments
This page was built for publication: A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354063)
