Abstract
The author investigates the sensitivity of the RLS algorithm to random perturbations about the optimum filter coefficients. Expressions are derived for the mean and variance of the deviation from the optimum error power for the prewindowed growing memory and the experimentally windowed ( lambda <1) RLS algorithm. The results show that the variance of the deviation for correlated signals increases compared to uncorrelated white signals by a term related to the sum of the square of the off-diagonal elements of the sample autocorrelation matrix. For lambda <1, the deviations are bounded and inversely proportional to 1- lambda . For lambda =1, the deviations are unbounded and increase linearly with the number of iterations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
