Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
563300 | Signal Processing | 2013 | 5 Pages |
Abstract
In order to improve the sparsity exploitation performance of norm constraint least mean square (LMS) algorithms, a novel adaptive algorithm is proposed by introducing a variable p-norm-like constraint into the cost function of the LMS algorithm, which exerts a zero attraction to the weight updating iterations. The parameter p of the p-norm-like constraint is adjusted iteratively along the negative gradient direction of the cost function. Numerical simulations show that the proposed algorithm has better performance than traditional l0 and l1 norm constraint LMS algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
F.Y. Wu, F. Tong,