logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A Variable Step-Size Regularization-Based Quasi-Newton Adaptive Filter for System Identification

delete2024-01-01
delete3
delete
OA
AI
M
Mehdi Bekrani *
H
Hadi Zayyani
DOI：10.1109/ACCESS.2024.3353691delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The family of least mean square (LMS) based adaptive filtering algorithms suffers from convergence performance limitation due to the sensitivity of such algorithms to the eigenvalue spread of the input correlation matrix. The quasi-Newton family of adaptive filtering algorithms addresses this limitation, but its performance is restricted by the estimation accuracy of the correlation matrix inverse, especially for highly correlated input signals. Furthermore, the convergence rate and the steady-state performance of both LMS and quasi-Newton families are thoroughly depending on their step-sizes. In this paper, a variable step-size regularized quasi-Newton adaptive algorithm is proposed in the context of system identification. In this algorithm, inspired by the matrix inversion lemma, a modified regularized matrix inverse with a time-varying regularization is computed such that during the convergence, the contribution of matrix inverse in the weight update is reduced, resulting in a more noise-robust algorithm. The paper further provides a convergence analysis of the proposed quasi-Newton algorithm, wherein a variable step-size is proposed to achieve a high initial convergence rate and a low steady-state error in the context of system identification applications.
Keywords:
Adaptive filter
quasi-newton algorithm
regularization
system identification
variable step-size

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

No organization information available