Low-complexity variable forgetting factor mechanism for recursive least-squares algorithms in interference suppression applications

In this work, the authors propose a low-complexity variable forgetting factor (VFF) mechanism for recursive least-squares algorithms in interference suppression applications. The proposed VFF mechanism employs an updated component related to the time average of the error correlation to automatically...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET communications Ročník 7; číslo 11; s. 1070 - 1080
Hlavní autoři: Cai, Yunlong, de Lamare, Rodrigo C
Médium: Journal Article
Jazyk:angličtina
Vydáno: Stevenage The Institution of Engineering and Technology 01.07.2013
John Wiley & Sons, Inc
Témata:
ISSN:1751-8628, 1751-8636
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í:In this work, the authors propose a low-complexity variable forgetting factor (VFF) mechanism for recursive least-squares algorithms in interference suppression applications. The proposed VFF mechanism employs an updated component related to the time average of the error correlation to automatically adjust the forgetting factor in order to ensure fast convergence and good tracking of the interference and the channel. Convergence and tracking analyses are carried out and analytical expressions for predicting the mean-squared error of the proposed adaptation technique are obtained. Simulation results for a direct-sequence code-division multiple access system are presented in non-stationary environments and show that the proposed VFF mechanism achieves superior performance to previously reported methods at a reduced complexity.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2012.0264