In sparse system identification, exploiting the sparsity property improves the performance of the least mean square (lms) algorithm. The improvement is achieved by adding an l(0) or l(1)-norm penalty term to the cost ...
详细信息
ISBN:
(纸本)9781728135786
In sparse system identification, exploiting the sparsity property improves the performance of the least mean square (lms) algorithm. The improvement is achieved by adding an l(0) or l(1)-norm penalty term to the cost function of the conventional lmsalgorithm. However, when the eignenvalue spread of the autocorrelation of the input is relatively large, the performance of the lmsalgorithm is poor. For instance, the lmsalgorithm cannot perform accurate system identification under the impulsive noise environment because its cost function is not well defined for such scenarios. In this paper, we propose a sparse variable step-size lmsalgorithm that employs arctan constraint in the cost function of the algorithm. This constraint imposes a zero attraction of the filter coefficients according to the relative value of each filter coefficient among all the entries. This, in turn, leads to an improved performance when the system is sparse. Different experiments have been conducted to investigate the performance of the proposed algorithm. Simulation results show that the proposed algorithm outperforms the zero attracting lms (ZA-lms) and the reweighted ZA-lms (RZA-lms) algorithms in a system identification setting under impulsive noise environment.
暂无评论