![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/8283D1E3-F08F-4857-B128-A2F810183A56 | ||
| Έτος | 1998 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | A. P. Liavas , P. A. Regalia, “Numerical accuracy issues of recursive least squares algorithms,”in 1998 Intern. Conf. Acoustics, Speech and Sig.Processing,pp.1409 - 1412.doi: 10.1109/ICASSP.1998.681711 https://doi.org/10.1109/ICASSP.1998.681711 | ||
| Εμφανίζεται στις Συλλογές |
The continuous use of adaptive algorithms is strongly dependent on their behavior in finite-precision environments. We study the nonlinear round-off error accumulation system of the conventional RLS algorithm and we derive bounds for the relative precision of the computations and the accumulated round-off error, which guarantee the numerical stability of the finite-precision implementation of the algorithm. The bounds depend on the conditioning of the problem and the exponential forgetting factor. Simulations agree with our theoretical results
Copyright © DIAS 2013
