By Topic

Stability analysis of predictor based least squares algorithm and finite precision arithmetic error effects

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

2 Author(s)
Youhua Wang ; Dept. of Electr. & Comput. Eng., Kanazawa Univ., Japan ; K. Nakayama

The numerical property of the recursive least squares (RLS) algorithm has been extensively studied. However, very few investigations are reported concerning the numerical behavior of the predictor based least squares (PLS) algorithms that provide the same least square solutions as the RLS algorithm. This paper studies the numerical property of the backward PLS (BPLS) algorithm. First, the stability of the BPLS algorithm is verified by using the state space method. Then, finite-precision arithmetic error effects on both the BPLS and the RLS algorithms are presented through computer simulations. Some important results are obtained, which demonstrate that the BPLS algorithm appears quite robust to round-off errors and provides a much more accurate and stable numerical performance than that of the RLS algorithm under finite-precision implementation

Published in:

TENCON '96. Proceedings., 1996 IEEE TENCON. Digital Signal Processing Applications  (Volume:2 )

Date of Conference:

26-29 Nov 1996