A new variable step-size block LMS algorithm for a non-stationary sparse systems

2015

Closed access Metadata (CSL-JSON)
DOI 10.1109/icecco.2015.7416869
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The conventional LMS algorithm has been successfully used in adaptive filtering for system identification (SI) problem. In telecommunications, acoustic echo SI problems usually have relatively large filter lengths that take a long time to be estimated. To overcome this problem, the block least-mean-square algorithm (BLMS) has been proposed. In BLMS, the filter coefficients are updated for blocks of input instead of each sample of input data. Using this advantage, we propose a new block-LMS algorithm with a function controlled variable step-size LMS (FC-VSSLMS) for non-stationary sparse systems identification. The performance of proposed algorithm is compared to those of the original BLMS and reweighted zero-attracting block LMS (RZA-BLMS), in terms of convergence rate and mean-square-deviation (MSD) in additive white Gaussian noise (AWGN) and additive uniformly distributed noise (AUDN). Simulations show that the proposed algorithm has a better performance than those of the other algorithms.