Modified LMS and NLMS algorithms with non-negative weights

Non-negative constraints arise in certain system identification problems when the systems to be identified have only positive coefficients. This paper studies the stochastic behavior of modified LMS and NLMS algorithms, modified so as to only allow adaptation with positive coefficients. The mean and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Signal processing Ročník 223; s. 109567
Hlavní autoři: Bershad, Neil J., Bermudez, José C.M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.10.2024
Témata:
Adaptive filters
Analysis
LMS algorithm
Stochastic algorithms
Stochastic algorithms
LMS algorithm
Adaptive filters
Analysis
ISSN:0165-1684
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Non-negative constraints arise in certain system identification problems when the systems to be identified have only positive coefficients. This paper studies the stochastic behavior of modified LMS and NLMS algorithms, modified so as to only allow adaptation with positive coefficients. The mean and second moment behavior of these algorithms are analyzed for Gaussian inputs. Excellent agreement is demonstrated between the theory and Monte Carlo simulations for the LMS algorithm. •Convergence of LMS and NLMS algorithms under non-negative weight constraints.•At each iteration, the weight vector is projected onto the feasible space.•The new algorithm optimally projects the weight vector onto the feasible set.•Models are derived for the mean and mean-square behavior of the adaptive weights.•Simulation results are in excellent agreement with theoretical predictions.
ISSN:0165-1684
DOI:10.1016/j.sigpro.2024.109567