No abstract

No abstract

SUMMARYIn this paper, a novel adaptive filter for sparse systems is proposed. The proposed algorithm incorporates a log‐sum penalty into the cost function of the standard leaky least mean square (LMS) algorithm, which results in a shrinkage in the update equation. This shrinkage, in turn, enhances the performance of the adaptive filter, especially, when the majority of unknown system coefficients are zero. Convergence analysis of the proposed algorithm is presented, and a stability criterion for the algorithm is derived. This algorithm is given a name of zero‐attracting leaky‐LMS (ZA‐LLMS) algorithm. The performance of the proposed ZA‐LLMS algorithm is compared to those of the standard leaky‐LMS and ZA‐LMS algorithms in sparse system identification settings, and it shows superior performance compared to the aforementioned algorithms. Copyright © 2013 John Wiley & Sons, Ltd.

No abstract

No abstract