.png){kind=icon}
.png){kind=icon}
Return
Quaternion kernel recursive least-squares algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2020.107810.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Various kernel-based algorithms have been successfully applied to nonlinear problems in adaptive filters over the last two decades. In this paper, we study a kernel recursive least squares (KRLS) algorithm in the quaternion domain. By the generalized Hamilton-real calculus method, we can apply the kernel trick to calculate the quaternion KRLS filter. In order to show the feasibility of the proposed algorithm, firstly we investigate the quaternion recursive least squares (QRLS) algorithm, and simulations show that the proposed QRLS algorithm has the same steady error as that of the closed-form solution; Secondly, we generalize the QRLS algorithm to the quaternion KRLS algorithm, theoretical analysis show the convergence, and simulations are described demonstrating the performance of the proposed algorithm. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Quaternion involutions
Quaternion kernel adaptive filter
Recursive least squares
Kernel recursive least square
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.