.png){kind=icon}
.png){kind=icon}
Return
Low-complexity recursive constrained maximum Versoria criterion adaptive filtering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2024.109726.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linearly-constrained adaptive filtering algorithms have emerged as promising candidates for system estimation. The existing methods such as the constrained least mean square algorithm rely on mean square error based learning, which delivers suboptimal performance under non-Gaussian noise environments. Therefore, the recursive constrained maximum Versoria criterion (RCMVC) algorithm has been derived and is robust against impulsive distortions. Nonetheless, RCMVC suffers from a notable computational overhead stemming from matrix inversion operations. To circumvent this issue, utilizing the weighting method and the dichotomous coordinate descent (DCD) iteration method, this paper derives a low-complexity version of the RCMVC algorithm called DCD-RCMVC, which alleviates the requirement of matrix inversion and enhances the estimation accuracy and robustness against non-Gaussian interference. Furthermore, we also present a comprehensive theoretical analysis of the DCD-RCMVC algorithm, encompassing discussions on its equivalence, convergence properties, and computational complexity. Simulations performed for system identification problems indicate that the DCD-RCMVC algorithm outperforms the existing state-of-art approaches.
Keywords:
Recursive constrained maximum Versoria
criterion
Adaptive filtering
Dichotomous coordinate descent
Method of weighting
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W