By Topic

Fixed-point roundoff error analysis of the exponentially windowed RLS algorithm for time-varying systems

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)
S. Ardalan ; North Carolina State University, Raleigh, NC ; S. Alexander

A fixed-point roundoff error analysis of the exponentially windowed RLS algorithm is presented. It is shown that a tradeoff exists in the choice of the forgetting factor λ. In order to reduce the sensitivity of the algorithm to additive noise, λ must be chosen close to one. On the other hand, the roundoff error increases as \lambda \rightarrow 1 . It is shown that the algorithm is stabilized with λ < 1. The algorithm may diverge for \lambda \rightarrow 1 . To derive the theoretical results, it is assumed that the input signal is a white Gaussian random process. Finally, simulations are presented which confirm the theoretical findings of the paper.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:35 ,  Issue: 6 )