Sparse least mean fourth filter with zero-attracting ℓ1-norm constraint

Traditional stable adaptive filter was used normalized least-mean square (NLMS) algorithm. However, identification performance of the traditional filter was especially vulnerable to degradation in low signal-noise-ratio (SRN) regime. Recently, adaptive filter using normalized least-mean fourth (NLMF...

Full description

Saved in:
Bibliographic Details
Published in2013 9th International Conference on Information, Communications and Signal Processing (ICICS) pp. 1 - 5
Main Authors Guan Gui, Adachi, Fumiyuki
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2013
Subjects
Online AccessGet full text
DOI10.1109/ICICS.2013.6782810

Cover

More Information
Summary:Traditional stable adaptive filter was used normalized least-mean square (NLMS) algorithm. However, identification performance of the traditional filter was especially vulnerable to degradation in low signal-noise-ratio (SRN) regime. Recently, adaptive filter using normalized least-mean fourth (NLMF) is attracting attention in adaptive system identifications (ASI) due to its high identification performance and stability. In the case of sparse system, however, the NLMF filter cannot identify effectively due to the fact that its algorithm neglects the inherent sparse structure. In this paper, we proposed a sparse NLMF filter using zero-attracting ℓ 1 -norm constraint to exploit the sparsity and to improve the identification performance. Effectiveness of the proposed filter is confirmed from two aspects: 1) stability is derived equivalent to well-known stable NLMS filter; 2) identification performance of the proposed is verified by mean square deviation (MSD) standard in computer simulations. When comparing with conventional adaptive filter, the proposed one can achieve much better identification performance especially in low SNR regime.
DOI:10.1109/ICICS.2013.6782810