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...
Saved in:
| Published in: | IET communications Vol. 7; no. 11; pp. 1070 - 1080 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Stevenage
The Institution of Engineering and Technology
01.07.2013
John Wiley & Sons, Inc |
| Subjects: | |
| ISSN: | 1751-8628, 1751-8636 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | 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 |