pith. sign in

arxiv: 1401.0463 · v1 · pith:CVCCF6I5new · submitted 2014-01-02 · 📡 eess.SY · cs.SY

Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage

classification 📡 eess.SY cs.SY
keywords algorithmsalternatingoptimizationschemeadaptiveproposedshrinkagesparsity-aware
0
0 comments X
read the original abstract

This letter proposes a novel sparsity-aware adaptive filtering scheme and algorithms based on an alternating optimization strategy with shrinkage. The proposed scheme employs a two-stage structure that consists of an alternating optimization of a diagonally-structured matrix that speeds up the convergence and an adaptive filter with a shrinkage function that forces the coefficients with small magnitudes to zero. We devise alternating optimization least-mean square (LMS) algorithms for the proposed scheme and analyze its mean-square error. Simulations for a system identification application show that the proposed scheme and algorithms outperform in convergence and tracking existing sparsity-aware algorithms.

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.