By Topic

H bounds for the recursive-least-squares 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
$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

2 Author(s)
Hassibi, B. ; Inf. Syst. Lab., Stanford Univ., CA, USA ; Kailath, T.

We obtain upper and lower bounds for the H norm of the RLS (recursive-least-squares) algorithm. The H norm may be regarded as the worst-case energy gain from the disturbances to the prediction errors, and is therefore a measure of the robustness of an algorithm to perturbations and model uncertainty. Our results allow one to compare the robustness of RLS compared to the LMS (least-mean-squares) algorithm, which is known to minimize the H norm. Simulations are presented to show the behaviour of RLS relative to these bounds

Published in:

Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on  (Volume:4 )

Date of Conference:

14-16 Dec 1994