.png){kind=icon}
.png){kind=icon}
Return
A Proportionate Recursive Least Squares Algorithm and Its Performance Analysis
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.3004466.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The proportionate updating (PU) mechanism has been widely adopted in least mean squares (LMS) adaptive filtering algorithms to exploit the system sparsity. In this brief, we propose a proportionate recursive least squares (PRLS) algorithm for the sparse system estimation, in which, an independent weight update is assigned to each tap according to the magnitude of that estimated filter coefficient. Its mean square performance is analyzed via the energy conservation principle in both the transient and steady-state stages. In this way, an explicit condition on the control parameter of the proportionate matrix of PRLS can be obtained to ensure a better steady-state performance than that of RLS. Simulation results in a system identification setting support the analysis.
Keywords:
Recursive least squares (RLS)
proportionate matrix
energy conservation principle
sparse systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W