With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued no...With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square(LMS) algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error(MSE) performance among of complex kernel LMS(KLMS) methods according to the specified kernel bandwidth and the length of dictionary.展开更多
The paper deals with state estimation problem of nonlinear non-Gaussian discrete dynamic systems for improvement of accuracy and consistency. An efficient new algorithm called the adaptive Gaussian-sum square-root cub...The paper deals with state estimation problem of nonlinear non-Gaussian discrete dynamic systems for improvement of accuracy and consistency. An efficient new algorithm called the adaptive Gaussian-sum square-root cubature Kalman filter(AGSSCKF) with a split-merge scheme is proposed. It is developed based on the squared-root extension of newly introduced cubature Kalman filter(SCKF) and is built within a Gaussian-sum framework. Based on the condition that the probability density functions of process noises and initial state are denoted by a Gaussian sum using optimization method, a bank of SCKF are used as the sub-filters to estimate state of system with the corresponding weights respectively, which is adaptively updated. The new algorithm consists of an adaptive splitting and merging procedure according to a proposed split-decision model based on the nonlinearity degree of measurement. The results of two simulation scenarios(one-dimensional state estimation and bearings-only tracking) show that the proposed filter demonstrates comparable performance to the particle filter with significantly reduced computational cost.展开更多
基金supported by the National Natural Science Foundation of China(6100115361271415+4 种基金6140149961531015)the Fundamental Research Funds for the Central Universities(3102014JCQ010103102014ZD0041)the Opening Research Foundation of State Key Laboratory of Underwater Information Processing and Control(9140C231002130C23085)
文摘With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square(LMS) algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error(MSE) performance among of complex kernel LMS(KLMS) methods according to the specified kernel bandwidth and the length of dictionary.
基金supported by the National Natural Science Foundation of China(No. 61032001)Shandong Provincial Natural Science Foundation of China (No. ZR2012FQ004)
文摘The paper deals with state estimation problem of nonlinear non-Gaussian discrete dynamic systems for improvement of accuracy and consistency. An efficient new algorithm called the adaptive Gaussian-sum square-root cubature Kalman filter(AGSSCKF) with a split-merge scheme is proposed. It is developed based on the squared-root extension of newly introduced cubature Kalman filter(SCKF) and is built within a Gaussian-sum framework. Based on the condition that the probability density functions of process noises and initial state are denoted by a Gaussian sum using optimization method, a bank of SCKF are used as the sub-filters to estimate state of system with the corresponding weights respectively, which is adaptively updated. The new algorithm consists of an adaptive splitting and merging procedure according to a proposed split-decision model based on the nonlinearity degree of measurement. The results of two simulation scenarios(one-dimensional state estimation and bearings-only tracking) show that the proposed filter demonstrates comparable performance to the particle filter with significantly reduced computational cost.