pith. sign in

arxiv: 2204.08990 · v1 · pith:WVTRVFSTnew · submitted 2022-04-09 · 📡 eess.SP · cs.IT· cs.LG· math.IT

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

classification 📡 eess.SP cs.ITcs.LGmath.IT
keywords algorithmalgorithmsimpulsivenoises-rrlssparsity-awarejo-s-rrlsjointly-optimized
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.