scholarly journals On multiplicative update with forgetting factor adaptive step size for least mean-square algorithms

Author(s):  
Robin Gerzaguet ◽  
Laurent Ros ◽  
Fabrice Belveze ◽  
Jean-Marc Brossier
2007 ◽  
Vol 130 (1) ◽  
Author(s):  
Yesim Sabah ◽  
Masaaki Okuma ◽  
Minoru Okubo

The purpose of this paper is to investigate a modified adaptive step-size algorithm and implement an active noise control (ANC) system. It is well known that there is a tradeoff between steady state error and convergence rate depending on the step size. This study shows that the new algorithm can track changes in the dynamic characteristics of the ANC system as well as produce a low steady state error. Simulation results are presented to compare the performance of the new algorithm to the basic least mean square (LMS) algorithm. Although there have been several studies of adaptive step-size algorithms, no quantitative analysis has yet been reported for real time active noise control application as far as the authors know. Experimental results are presented for a duct system. The results indicate that the new algorithm provides better performance than the fixed step-size filtered-X least mean square (FXLMS) algorithm.


2016 ◽  
Vol 26 (04) ◽  
pp. 1650056
Author(s):  
Auni Aslah Mat Daud

In this paper, we present the application of the gradient descent of indeterminism (GDI) shadowing filter to a chaotic system, that is the ski-slope model. The paper focuses on the quality of the estimated states and their usability for forecasting. One main problem is that the existing GDI shadowing filter fails to provide stability to the convergence of the root mean square error and the last point error of the ski-slope model. Furthermore, there are unexpected cases in which the better state estimates give worse forecasts than the worse state estimates. We investigate these unexpected cases in particular and show how the presence of the humps contributes to them. However, the results show that the GDI shadowing filter can successfully be applied to the ski-slope model with only slight modification, that is, by introducing the adaptive step-size to ensure the convergence of indeterminism. We investigate its advantages over fixed step-size and how it can improve the performance of our shadowing filter.


2021 ◽  
pp. 107754632110228
Author(s):  
Yubin Fang ◽  
Xiaojin Zhu ◽  
Xiaobing Zhang

The variable step size least mean square algorithm has been suggested since a number of years as a potential solution for improving the performance of least mean square algorithm. In this article, the variable step size least mean square algorithm is classified by the techniques which are used to update step size. Unfortunately, for variable step size least mean square algorithms with forgetting factor, a constant forgetting factor may slow down its convergence speed. For this reason, a variable forgetting factor method for variable step size least mean square is proposed in this article. First, the convergence analysis of a new variable step size least mean square algorithm with the variable forgetting factor is provided. Then, simulations expose the characteristics of this variable forgetting factor method. Last, a micro-vibration control experimental system is established. Four typical variable step size least mean square algorithms and their variable forgetting factor modified version are verified through experiments. The results show that the proposed variable forgetting factor method can effectively improve convergence speed while maintaining the steady-state performance of the variable step size least mean square algorithm with the constant forgetting factor.


Sign in / Sign up

Export Citation Format

Share Document