A Robust Variable Forgetting Factor Recursive Least-Squares Algorithm for System Identification

The performance of the recursive least-squares (RLS) algorithm is governed by the forgetting factor. This parameter leads to a compromise between (1) the tracking capabilities and (2) the misadjustment and stability. In this letter, a variable forgetting factor RLS (VFF-RLS) algorithm is proposed fo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 15; s. 597 - 600
Hlavní autoři: Paleologu, C., Benesty, J., Ciochina, S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The performance of the recursive least-squares (RLS) algorithm is governed by the forgetting factor. This parameter leads to a compromise between (1) the tracking capabilities and (2) the misadjustment and stability. In this letter, a variable forgetting factor RLS (VFF-RLS) algorithm is proposed for system identification. In general, the output of the unknown system is corrupted by a noise-like signal. This signal should be recovered in the error signal of the adaptive filter after this one converges to the true solution. This condition is used to control the value of the forgetting factor. The simulation results indicate the good performance and the robustness of the proposed algorithm.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2008.2001559