Abstract
The recursive least-squares (RLS) algorithm should be explicitly regularized to achieve a satisfactory performance when the signal-to-noise ratio is low. However, a direct implementation of the involved matrix inversion results in a high complexity. In this paper, we present a recursive approach to the matrix inversion of the dynamically regularized RLS algorithm by exploiting the special structure of the correlation matrix. The proposed method has a similar complexity to the standard RLS algorithm. Moreover, the new method provides an exact solution for a fixed regularization parameter, and it has a good accuracy even for a slowly time-varying regularization parameter. Simulation results confirm the effectiveness of the new method.
Original language | English |
---|---|
Title of host publication | 2019 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2019 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1072-1075 |
Number of pages | 4 |
ISBN (Electronic) | 9781728132488 |
DOIs | |
Publication status | Published - Nov 2019 |
Externally published | Yes |
Event | 2019 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2019 - Lanzhou, China Duration: Nov 18 2019 → Nov 21 2019 |
Publication series
Name | 2019 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2019 |
---|
Conference
Conference | 2019 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2019 |
---|---|
Country/Territory | China |
City | Lanzhou |
Period | 11/18/19 → 11/21/19 |
Bibliographical note
Publisher Copyright:© 2019 IEEE.
ASJC Scopus Subject Areas
- Information Systems