Dispersed-sparsity-aware LMS algorithm for scattering-sparse system identification

Abstract

We develop a least-mean-squares (LMS) algorithm to identify scattering-sparse systems, where the few significantly large coefficients of the unknown impulse response are dispersed along the full length, instead of grouped into clusters. Many wireless communication channels such as the underwater acoustic channels, cellular communication channels and aviation channels are typical scattering-sparse systems. In the proposed strategy, the difference between the ℓ1-norm and ℓ∞,1-norm of the uniformly-divided tap-weight vector of the adaptive filter is utilized as a penalty and is introduced into the mean-square-error cost function, where the ℓ∞,1-norm of the tap-weight vector is used to locate the unknown large coefficients in view of the characteristics of dispersed sparsity. A dispersed-sparsity-aware LMS (DS-LMS) algorithm is then proposed by following the stochastic subgradient method. We study the mean and mean-square behaviors of the proposed algorithm. We also provide theoretical guidelines for the parameter settings that ensure that the proposed DS-LMS algorithm converges to a lower mean-square-deviation (MSD) level than the traditional LMS algorithm. Simulation results verify the effectiveness of the proposed DS-LMS algorithm, and correctness of the theoretical findings.