Block-Sparsity Log-Sum-Induced Adaptive Filter for Cluster Sparse System Identification

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 the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2020, Vol.8, p.175265-175276
Hauptverfasser: Zhang, Aihua, Liu, Pengcheng, Sun, Jun, Ning, Bing
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 the LMS algorithm. We utilize the {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 the steady-state mis-adjustment and convergence behaviors of the BSLS-LMS are derived in a general sparse system and a block sparse system, respectively. Numerical experiments demonstrate that the proposed adaptive BSLS-LMS algorithm achieves much better convergence behavior than conventional sparse signal recovery solutions. The experimental study also verifies the consistency between the simulation results and the theoretical analysis.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.3026058