Study of General Robust Subband Adaptive Filtering
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a general robust subband adaptive filtering (GR-SAF) scheme against impulsive noise by minimizing the mean square deviation under the random-walk model with individual weight uncertainty. Specifically, by choosing different scaling factors such as from the M-estimate and maximum correntropy robust criteria in the GR-SAF scheme, we can easily obtain different GR-SAF algorithms. Importantly, the proposed GR-SAF algorithm can be reduced to a variable regularization robust normalized SAF algorithm, thus having fast convergence rate and low steady-state error. Simulations in the contexts of system identification with impulsive noise and echo cancellation with double-talk have verified that the proposed GR-SAF algorithms outperforms its counterparts.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 144 references that are in the map. First posted on arXiv 4 Aug 2022.
Builds on
7 of 144 references.
References · 7
- 2016Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniquescited by 20
- 2014Direction Finding Algorithms with Joint Iterative Subspace Optimizationcited by 19
- 2014Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkagecited by 15
- 2015Generalized Correntropy for Robust Adaptive Filteringcited by 10
- 2018Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximationcited by 10
- 2018Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agentscited by 10
- 2016Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filteringcited by 3
Built on by
Not cited yet.