By Topic

Exact Convergence Analysis of Adaptive Filter Algorithms Without the Persistently Exciting Condition

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
$31 $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

3 Author(s)
Sakai, H. ; Dept. of Syst. Sci., Kyoto Univ. ; Jun-Mei Yang ; Oka, T.

Exact convergence analysis of the recursive least square and least mean square (LMS) algorithms in adaptive filtering is presented for the case of sinusoidal signal cancellation without the persistently exciting condition. This situation occurs when the number of tap coefficients of the adaptive filter exceeds that of the complex sinusoids in the input signal. The convergent point of both algorithms is shown to be the one determined by the pseudo inverse of the deterministic covariance matrix. The convergence proof for the LMS algorithm is based on the Lyapunov function method. Finally, the validity of the obtained results is supported by simulation results

Published in:

Signal Processing, IEEE Transactions on  (Volume:55 ,  Issue: 5 )