A Decomposition-Based RLS Algorithm with Variable Forgetting Factors
The performance of the recursive least-squares (RLS) algorithm is mainly controlled by the forgetting factor. Using a constant value of this important parameter leads to a compromise between the main performance criteria, i.e., low misadjustment versus fast tracking. In this paper, we propose a vari...
Saved in:
| Published in: | 2020 13th International Conference on Communications (COMM) pp. 43 - 48 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.06.2020
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!