Variable p norm constrained LMS algorithm based on gradient of root relative deviation.pdf
نویسندگان
چکیده
A new Lp-norm constraint least mean square (Lp-LMS) algorithm with new strategy of varying p is presented, which is applied to system identification in this letter. The parameter p is iteratively adjusted by the gradient method applied to the root relative deviation of the estimated weight vector. Numerical simulations show that this new algorithm achieves lower steady-state error as well as equally fast convergence compared with the traditional Lp-LMS and LMS algorithms in the application setting of sparse system identification in the presence of noise.
منابع مشابه
An Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm
The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...
متن کاملGradient optimization p-norm-like constraint LMS algorithm for sparse system estimation
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 negat...
متن کاملError Gradient-based Variable-Lp Norm Constraint LMS Algorithm for Sparse System Identification
Sparse adaptive filtering has gained much attention due to its wide applicability in the field of signal processing. Among the main algorithm families, sparse norm constraint adaptive filters develop rapidly in recent years. However, when applied for system identification, most priori work in sparse norm constraint adaptive filtering suffers from the difficulty of adaptability to the sparsity o...
متن کاملA new gradient based variable step-size LMS algorithm
A new gradient-based variable step-size LMS algorithm (VSSLMS) is proposed in this paper. The step size of the proposed algorithm is proportional to the squared norm of the smoothed gradient vector, which is a proximity measure of the adaptive process. In comparison with the existing methods, the proposed VSSLMS algorithm has improved convergence properties. Furthermore, the parameter choice of...
متن کاملGradient Compared Lp-LMS Algorithms for Sparse System Identification
In this paper, we propose two novel p-norm penalty least mean square (lp-LMS) algorithms as supplements of the conventional lp-LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.09022 شماره
صفحات -
تاریخ انتشار 2016