By Topic

Non-Uniform Norm Constraint LMS Algorithm for Sparse System Identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wu, F.Y. ; Key Lab. of Underwater Acoust. Commun. & Marine Inf. Technol. of the Minister of Educ., Xiamen Univ., Xiamen, China ; Tong, F.

Sparsity property has long been exploited to improve the performance of least mean square (LMS) based identification of sparse systems, in the form of l0-norm or l1-norm constraint. However, there is a lack of theoretical investigations regarding the optimum norm constraint for specific system with different sparsity. This paper presents an approach by seeking the tradeoff between the sparsity exploitation effect of norm constraint and the estimation bias it produces, from which a novel algorithm is derived to modify the cost function of classic LMS algorithm with a non-uniform norm (p-norm like) penalty. This modification is equivalent to impose a sequence of l0-norm or l1-norm zero attraction elements on the iteration according to the relative value of each filter coefficient among all the entries. The superiorities of the proposed method including improved convergence rate as well as better tolerance upon different sparsity are demonstrated by numerical simulations.

Published in:

Communications Letters, IEEE  (Volume:17 ,  Issue: 2 )