By Topic

Performance analysis of least mean modulus-Newton algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shin' ichi Koike ; Consultant, Tokyo, Japan

This paper derives an adaptation algorithm named least mean modulus-Newton (LMM-Newton) algorithm that combines least mean modulus (LMM) algorithm with simple recurrent calculation of the inverse covariance matrix of the filter input using the Newton's method. The LMM-Newton algorithm achieves significant improvement in the convergence speed of complex-domain adaptive filters with a strongly correlated input. The algorithm is effective in making adaptive filter convergence as fast as that for the LMM algorithm with a white input process even in the presence of impulsive observation noise, preserving the robustness of the LMM algorithm against impulse noise. Through transient analysis and experiment with simulations and theoretical calculations of filter convergence, we demonstrate effectiveness of the LMM-Newton algorithm. Good agreement between simulated and theoretical convergence proves the validity of the analysis.

Published in:

Intelligent Signal Processing and Communication Systems, 2009. ISPACS 2009. International Symposium on

Date of Conference:

7-9 Jan. 2009