Skip to Main content Skip to Navigation
New interface
Conference papers

Group sparse LMS for multiple system identification

Lei Yu 1 Chen Wei 1 Gang Zheng 2, 3 
3 NON-A - Non-Asymptotic estimation for online systems
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : Armed with structures, group sparsity can be exploited to extraordinarily improve the performance of adaptive estimation. In this paper, a group sparse regularized least-mean-square (LMS) algorithm is proposed to cope with the identification problems for multiple/multi-channel systems. In particular, the coefficients of impulse response function for each system are assumed to be sparse. Then, the dependencies between multiple systems are considered, where the coefficients of impulse responses of each system share the same pattern. An iterative online algorithm is proposed via proximal splitting method. At the end, simulations are carried out to verify the superiority of our proposed algorithm to the state-of-the-art algorithms.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Gang Zheng Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2016 - 4:08:12 PM
Last modification on : Tuesday, November 22, 2022 - 2:26:16 PM



Lei Yu, Chen Wei, Gang Zheng. Group sparse LMS for multiple system identification. 23rd European Signal Processing Conference , Aug 2015, Nice, France. ⟨10.1109/EUSIPCO.2015.7362672⟩. ⟨hal-01252391⟩



Record views