mlsanityData to 14 Oct 2026

Study of Robust Sparsity-Aware RLS algorithms with Jointly-Optimized Parameters for Impulsive Noise Environments

arXiv 2204.08990 ↗First posted 9 Apr 2022eess.SP cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper proposes a unified sparsity-aware robust recursive least-squares RLS (S-RRLS) algorithm for the identification of sparse systems under impulsive noise. The proposed algorithm generalizes multiple algorithms only by replacing the specified criterion of robustness and sparsity-aware penalty. Furthermore, by jointly optimizing the forgetting factor and the sparsity penalty parameter, we develop the jointly-optimized S-RRLS (JO-S-RRLS) algorithm, which not only exhibits low misadjustment but also can track well sudden changes of a sparse system. Simulations in impulsive noise scenarios demonstrate that the proposed S-RRLS and JO-S-RRLS algorithms outperform existing techniques.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 98 references that are in the map. First posted on arXiv 9 Apr 2022.

Builds on

7 of 98 references.

References · 7

  1. 2014Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problemscited by 64
  2. 2016Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniquescited by 20
  3. 2014Direction Finding Algorithms with Joint Iterative Subspace Optimizationcited by 19
  4. 2014Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkagecited by 15
  5. 2015Generalized Correntropy for Robust Adaptive Filteringcited by 10
  6. 2018Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximationcited by 10
  7. 2018Recursive Geman-McClure method for implementing second-order Volterra filtercited by 3

Built on by

Not cited yet.