By Topic

Transient and tracking performance bounds of the sign-sign 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)
E. Eweda ; Mil. Tech. Coll., Cairo, Egypt

The paper provides a rigorous tracking analysis of the sign-sign algorithm when used in the identification of a time-varying plant with a white Gaussian input. The plant parameters vary according to a random walk model. The assumptions allow nonstationarity of the plant input, plant noise, and increments of the plant parameters. Upper bounds are derived for the long-term averages of the mean of the weight misalignment norm, mean absolute error, mean square weight misalignment, and mean square error. These bounds hold for all values of the algorithm step size, all initial filter weight settings, and all degrees of nonstationarity of the plant input, plant noise, and plant parameter increments. Lower bounds of the mean square weight misalignment and mean square error are also derived. The step sizes that minimize the above bounds are derived. A transient analysis of the algorithm is done in the case of a time-invariant plant. A tight lower bound of the convergence time is derived. The above analytical results are supported by computer simulations

Published in:

IEEE Transactions on Signal Processing  (Volume:47 ,  Issue: 8 )