Properties of the momentum LMS algorithm

Date

1989-10

Author

Tugay, Mehmet Ali
Tanik, Yalçin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

203
views

0
downloads

One of the most recent modifications on Widrow and Hoff's LMS algorithm has been the inclusion of a momentum term into the weight update equation. The resulting algorithm is referred to as “The Momentum LMS (MLMS) algorithm”. This paper revises the basic properties of the MLMS algorithm for stationary inputs. As a result, new bounds, on the parameters of the algorithm, for convergence are found, and it is shown that, under slow convergence conditions, this new algorithm is equivalent to the usual LMS algorithm, but it outperforms the LMS algorithm for fast convergence cases and for inputs containing inpulsive noise components.

Subject Keywords

Control and Systems Engineering, Signal Processing, Electrical and Electronic Engineering, Software, Computer Vision and Pattern Recognition

URI

https://hdl.handle.net/11511/51702

Journal

Signal Processing

DOI

https://doi.org/10.1016/0165-1684(89)90044-3

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Making linear prediction perform like maximum likelihood in Gaussian autoregressive model parameter estimation Candan, Çağatay (Elsevier BV, 2020-01-01) A two-stage method for the parameter estimation of Gaussian autoregressive models is proposed. The proposed first stage is an improved version of the conventional forward-backward prediction method and can be interpreted as its weighted version with the weights derived from the arithmetic mean of the log-likelihood functions for different conditioning cases. The weighted version is observed to perform better than the conventional forward-backward prediction method and other linear prediction based methods (...
Deconvolution and preequalization with best delay LS inverse filters Tuncer, Temel Engin (Elsevier BV, 2004-11-01) A new method for finding the best delay for the design of least-squares (1,S) inverse filters is introduced. It is shown that there is a considerable difference between the LS errors of a best delay filter and an arbitrary LS inverse filter. Proposed method is an effective and computationally efficient approach for the design of LS optimum filters. Deconvolution problem is considered and the MSE performances of pseudoinverse, preequalization and LS inverse filtering are investigated. In this respect, the th...
A unified framework for derivation and implementation of Savitzky-Golay filters Candan, Çağatay (Elsevier BV, 2014-11-01) The Savitzky-Golay (SG) filter design problem is posed as the minimum norm solution of an underdetermined equation system. A unified SG filter design framework encompassing several important applications such as smoothing, differentiation, integration and fractional delay is developed. In addition to the generality and flexibility of the framework, an efficient SG filter implementation structure, naturally emerging from the framework, is proposed. The structure is shown to reduce the number of multipliers i...
A tracker-aware detector threshold optimization formulation for tracking maneuvering targets in clutter Aslan, Murat Samil; Saranlı, Afşar (Elsevier BV, 2011-09-01) In this paper, we consider a tracker-aware radar detector threshold optimization formulation for tracking maneuvering targets in clutter. The formulation results in an online method with improved transient performance. In our earlier works, the problem was considered in the context of the probabilistic data association filter (PDAF) for non-maneuvering targets. In the present study, we extend the ideas in the PDAF formulation to the multiple model (MM) filtering structures which use PDAFs as modules. Althou...
A statistical approach to sparse multi-scale phase-based stereo Ulusoy, İlkay (Elsevier BV, 2007-09-01) In this study, a multi-scale phase based sparse disparity algorithm and a probabilistic model for matching uncertain phase are proposed. The features used are oriented edges extracted using steerable filters. Feature correspondences are estimated using phase-similarity at multiple scale using a magnitude weighting scheme. In order to achieve sub-pixel accuracy in disparity, we use a fine tuning procedure which employs the phase difference between corresponding feature points. We also derive a probabilistic ...

Citation Formats

M. A. Tugay and Y. Tanik, “Properties of the momentum LMS algorithm,” Signal Processing, pp. 117–127, 1989, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51702.