A block LMS-type algorithm for sparse system identification with analysis

Cemil Turan, Mohammad Salman

2017

Closed access Metadata (CSL-JSON)
DOI 10.1109/sibcon.2017.7998557
Data confidence 85 high
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 LMS-type algorithms are effectively used in diverse adaptive filtering applications such as; blind system identification, channel equalization, etc. For some applications such as echo cancellation, which requires a large filter length, a very long time is required to estimate the coefficients via the conventional least-mean-square (LMS) algorithm. Actually, updating the filter coefficients block by block of the input data but not for each sample of input, users can get a very fast processing time depending on the block length. Additionally, the performance of the block-LMS (BLMS) algorithm can be improved by using a variable step-size in the update equation. Also, in system identification, if the unknown system is sparse, then the performance of the algorithm can be improved further by imposing a penalty term in the cost function of the BLMS algorithm which, in turn, helps in exploiting the sparsity of the unknown system. In this paper, we investigate the performance of recently proposed BLMS-type algorithm for sparse systems. The convergence analysis of the proposed algorithm is presented for the first time. Also, the effects of the zero-attracting coefficient, ρ, and the sparsity degree on MSD have been investigated. Finally, the performance of the algorithm is compared to those of the BLMS and the other previously proposed adaptive algorithms, in terms of convergence rate and mean-square-deviation (MSD). Simulations show that the proposed algorithm guarantees better performance than the other algorithms.