Abstract
The objective of this work is to introduce a convex combination of two filters to perform a variable sparse system identification. The first filter is based on the Least Mean Fourth algorithm (LMF), whereas the second is based on its sparse aware version, i.e., the Zero-attractor-LMF (ZA-LMF) algorithm. The convex combination is proposed to solve the sparsity problem under non-Gaussian noise environments. The universality study of the filter indicates that the convex combination always chooses the component filter that offers the lowest Excess Mean Square Error (EMSE) possible. Computer Simulations are performed to confirm the theoretical findings.
Original language | English |
---|---|
Title of host publication | Conference Record - 53rd Asilomar Conference on Circuits, Systems and Computers, ACSSC 2019 |
Editors | Michael B. Matthews |
Publisher | IEEE Computer Society |
Pages | 794-799 |
Number of pages | 6 |
ISBN (Electronic) | 9781728143002 |
DOIs | |
State | Published - Nov 2019 |
Publication series
Name | Conference Record - Asilomar Conference on Signals, Systems and Computers |
---|---|
Volume | 2019-November |
ISSN (Print) | 1058-6393 |
Bibliographical note
Publisher Copyright:© 2019 IEEE.
Keywords
- Least Mean Fourth (LMF)
- Sparse solution
- Transform Domain (TD)
- Weighted Zero Attractor WZA
- Zero-Attractor ZA
- l norm
- l norm
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications