RLS Algorithm Summary
The RLS algorithm for a p-th order RLS filter can be summarized as
| Parameters: | filter order |
| forgetting factor | |
| value to initialize | |
| Initialization: | , |
| , | |
| where is the identity matrix of rank | |
| Computation: | For |
|
|
|
| . |
![\mathbf{x}(n) =
\left[
\begin{matrix}
x(n)\\
x(n-1)\\
\vdots\\
x(n-p)
\end{matrix}
\right]](http://upload.wikimedia.org/math/b/9/9/b999212000ae69557d9b1854829f39b6.png)
Note that the recursion for follows a Algebraic Riccati equation and thus draws parallels to the Kalman filter.
Read more about this topic: Recursive Least Squares Filter
Famous quotes containing the word summary:
“I have simplified my politics into an utter detestation of all existing governments; and, as it is the shortest and most agreeable and summary feeling imaginable, the first moment of an universal republic would convert me into an advocate for single and uncontradicted despotism. The fact is, riches are power, and poverty is slavery all over the earth, and one sort of establishment is no better, nor worse, for a people than another.”
—George Gordon Noel Byron (1788–1824)