Abstract
Identifying a sparse system impulse response is often performed with the \(l_0\)-least-mean-squares (LMS)-, or the zero-attracting LMS algorithm. Recently, a linearized Bregman (LB) iteration based sparse LMS algorithm has been proposed for this task. In this contribution, the mentioned algorithms are compared with respect to their parameter dependency, convergence speed, mean-square-error (MSE), and sparsity of the estimate. The performance of the LB iteration based sparse LMS algorithm only slightly depends on its parameters. In our opinion it is the favorable choice in terms of achieving sparse impulse response estimates and low MSE. Especially when using an extension called micro-kicking the LB based algorithms converge much faster than the \(l_0\)-LMS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, Y., Gu, Y., Hero, A.O.: Sparse LMS for system identification. In: 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3125–3128, April 2009
Gu, Y., Jin, J., Mei, S.: \(l_{0}\) norm constraint LMS algorithm for sparse system identification. IEEE Sig. Process. Lett. 16(9), 774–777 (2009)
Lunglmayr, M., Huemer, M.: Efficient linearized Bregman iteration for sparse adaptive filters and Kaczmarz solvers. In: 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), pp. 1–5, July 2016
Hu, T., Chklovskii, D.B.: Sparse LMS via online linearized Bregman iteration. In: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 7213–7217, May 2014
Chen, J., Richard, C., Song, Y., Brie, D.: Transient performance analysis of zero-attracting LMS. IEEE Sig. Process. Lett. 23(12), 1786–1790 (2016)
Salman, M.S., Jahromi, M.N.S., Hocanin, A., Kukrer, O.: A zero-attracting variable step-size LMS algorithm for sparse system identification. In: 2012 IX International Symposium on Telecommunications (BIHTEL), pp. 1–4, October 2012
Su, G., Jin, J., Gu, Y.: Performance analysis of \(\text{L}_{0}\text{-LMS }\) with Gaussian input signal. In: IEEE 10th International Conference on Signal Processing, pp. 235–238, October 2010
Wang, C., Zhang, Y., Wei, Y., Li, N.: A new \(l_0\)-LMS algorithm with adaptive zero attractor. IEEE Commun. Lett. 19(12), 2150–2153 (2015)
Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4(2), 460–489 (2005)
Cai, J.F., Osher, S., Shen, Z.: Convergence of the linearized Bregman iteration for \(\ell _{1}\)-norm minimization. AMS Math. Comput. 78(268), 2127–2136 (2009)
Yin, W.: SIAM J. Imaging Sci. 3(4), 856–877 (2010)
Lunglmayr, M., Huemer, M.: Microkicking for fast convergence of sparse Kaczmarz and sparse LMS. In: 25th European Signal Processing Conference (EUSIPCO) 2017 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Gebhard, A., Lunglmayr, M., Huemer, M. (2018). Investigations on Sparse System Identification with \(l_0\)-LMS, Zero-Attracting LMS and Linearized Bregman Iterations. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10672. Springer, Cham. https://doi.org/10.1007/978-3-319-74727-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-74727-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74726-2
Online ISBN: 978-3-319-74727-9
eBook Packages: Computer ScienceComputer Science (R0)