Abstract
Normalized forms of adaptive algorithms are usually sought in order to obtain convergence properties independent of the input signal power. Such is the case of the well-known Normalized LMS (NLMS) algorithm. The Least-Mean Fourth (LMF) adaptive algorithm has been shown to outperform LMS in different situations. However, the LMF stability is dependent on both the signal power and on the adaptive weights initialization. This paper studies the behavior of two normalized forms of the LMF algorithm for Gaussian inputs. Contrary to what could be expected, the mean-square stability of both normalized algorithms is shown to be dependent upon the input signal power. Thus, the usefulness of the NLMF algorithm is open to question.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have