Sparsity-Aware Robust Normalized Subband Adaptive Filtering algorithms based on Alternating Optimization
Not on the map. Why?
Abstract (arXiv)
This paper proposes a unified sparsity-aware robust normalized subband adaptive filtering (SA-RNSAF) algorithm for identification of sparse systems under impulsive noise. The proposed SA-RNSAF algorithm generalizes different algorithms by defining the robust criterion and sparsity-aware penalty. Furthermore, by alternating optimization of the parameters (AOP) of the algorithm, including the step-size and the sparsity penalty weight, we develop the AOP-SA-RNSAF algorithm, which not only exhibits fast convergence but also obtains low steady-state misadjustment for sparse systems. Simulations in various noise scenarios have verified that the proposed AOP-SA-RNSAF algorithm outperforms existing techniques.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 96 references that are in the map. First posted on arXiv 15 May 2022.
Builds on
5 of 96 references.
References · 5
- 2014Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problemscited by 64
- 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
- 2018Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximationcited by 10
Built on by
Not cited yet.