Block sparse reweighted zero-attracting normalised least mean square algorithm for system identification

Zhenhai Yan*, Feiran Yang, Jun Yang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

To improve the performance for identifying the block sparse system, a block sparse reweighted zero-attracting normalised least mean square algorithm (NLMS) (BS-RZA-NLMS) is proposed in this Letter. The proposed algorithm is derived by applying block sparsity constraint on the cost function of the NLMS, which is a log-sum penalty of adaptive tap weights with equal block partition sizes. The convergence behaviour of the BS-RZA-NLMS is analysed in terms of the zero attraction and block partition. Simulation results demonstrate the performance advantage of the proposed algorithm in the context of block sparse system identification.

Original languageEnglish
Pages (from-to)899-900
Number of pages2
JournalElectronics Letters
Volume53
Issue number14
DOIs
Publication statusPublished - Jul 6 2017
Externally publishedYes

Bibliographical note

Publisher Copyright:
© The Institution of Engineering and Technology 2017.

ASJC Scopus Subject Areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Block sparse reweighted zero-attracting normalised least mean square algorithm for system identification'. Together they form a unique fingerprint.

Cite this