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.823496zbMath1369.94107OpenAlexW2150709895MaRDI QIDQ5354063
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
Related Items (9)
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 ⋮ Recursive least mean \(p\)-power extreme learning machine ⋮ Robust multitask diffusion normalized M-estimate subband adaptive filter algorithm over adaptive networks ⋮ New polynomial approach to myriad filter computation ⋮ A Robust Regression Framework with Laplace Kernel-Induced Loss ⋮ Sequential and adaptive learning algorithms for M-estimation ⋮ A Novel Robust MM Filter against Outliers ⋮ Delay-dependent robust \(H _{\infty }\) filter design for uncertain linear systems with time-varying delay
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
