In this work, an effective adaptive block sparsity log-sum least mean square (BSLS-LMS) algorithm is proposed to improve the convergence performance of cluster sparse system identification. The main idea of the proposed scheme is to add a new block-sparsity induced term into the cost function of LMS algorithm. We utilize l_1 norm of adaptive tap weights and log-sum as a mixed constraint, via optimizing the cost function through the gradient descent method, the proposed adaptive filtering method can iteratively move the identified signals towards the optimal solutions, and finally identify the unknown system accurately. The cluster-sparse system response, with block length and arbitrary average sparsity, is generated by a Markov-Gaussian (M-G) model. For the white Gaussian input data, the theoretical formulas of steady-state mis-adjustment and convergence behaviors of BSLS-LMS are derived in general sparse system and block sparse system, respectively. Numerical experiments demonstrate that the proposed adaptive BSLS-LMS algorithm performs much better convergence behavior than conventional sparse signal recovery solutions. The experimental study also verifies the consistency between the simulations results and the theoretical analysis.
|Publication status||Accepted/In press - 17 Sept 2020|