PlumX Metrics
Embed PlumX Metrics

Stability of Compressed Recursive Least Squares with Forgetting Factor Algorithm

IFAC-PapersOnLine, ISSN: 2405-8963, Vol: 56, Issue: 2, Page: 10240-10245
2023
  • 0
    Citations
  • 0
    Usage
  • 3
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

Article Description

To identify the unknown sparse time-varying parameters of the stochastic dynamic system, we integrate compressive sensing theory with the traditional recursive least squares with forgetting factor (FFLS) algorithm, and propose a compressed adaptive filtering algorithm. Our algorithm is designed to first compress the original high-dimensional sparse regression vector by using the sensing matrix, and then apply the FFLS algorithm to estimate the compressed parameters. Subsequently, the original high-dimensional sparse parameters can be well recovered by a reconstruction technique. We introduce an excitation condition on the compressed stochastic regressors, under which the stability of the proposed algorithm (i.e., the upper bound of the estimation error) is established without assuming independence, stationarity or ergodicity of the system signals. The effectiveness of our theoretical results is demonstrated by a numerical example, which also shows that our proposed algorithm has better performance than both the compressed least mean squares algorithm and the uncompressed FFLS algorithm for tracking high-dimensional sparse parameters.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know