Abstract

The kernel adaptive filtering is an efficient and nonlinear approximation method which is developed in reproducing kernel Hilbert space (RKHS). Kernel function is used to map input data from original space to RKHS space, thus solving nonlinear problems is efficient.Impulse noise and non-Gaussian noise exist in the real application environment, and the probability density distribution of these noise characteristics shows a relatively heavy trailing phenomenon in the statistical sense. α stable distribution can be used to model this kind of non-Gaussian noise well. The kernel least mean square(KLMS) algorithms usually perform well in Gaussian noise, but the mean square error criterion only captures the second-order statistics of the error signal, this type of algorithm is very sensitive to outliers, in other words, it lacks robustness in α stable distribution noise. The kernel least logarithm absolute difference(KLLAD) algorithm can deal with outliers well, but it has the problem of slow convergence.In order to further improve the convergence speed of nonlinear adaptive filtering algorithm in α stable distributed noise background, a new kernel least logarithm absolute difference algorithm based on p-norm (P-KLLAD) is presented in this paper. The algorithm combining least logarithm absolute difference algorithm and p norm, on the one hand, the least logarithm difference criteria is ensure the algorithm to have good robustness in α stable distribution noise environment, and on the other hand, add p norm on the absolute value of error.The steepness of the cost function is controlled by p norm and a posititive constant ɑ to improve the convergence speed of the algorithm.The computer simulation results of Mackey-Glass chaotic time series prediction and nonlinear system identification show that this algorithm improves the convergence speed with good robustness,and the convergence speed and robustness better than the kernel least mean square algorithm,the kernel fractional lower power algorithm, the kernel least logarithm absolute difference algorithm and the kernel least mean p-norm algorithm.

Highlights

  • 为了进一步提高在 a 稳定分布噪声背景下非线性自适应滤波算法的收敛速度, 本文提出了一种新的基 于 p 范数的核最小对数绝对差自适应滤波算法. 该算法结合核最小对数绝对差算法和 p 范数, 一方面利用最小对数绝对差准则保证了算 法在 a 稳定分布噪声环境下良好的鲁棒性, 另一方面在误差的绝对值上添加 p 范数, 通过 p 范数和一个正常 数 a 来控制算法的陡峭程度, 从而提高该算法的收敛速度. 在非线性系统辨识和 Mackey-Glass 混沌时间序列 预测的仿真结果表明, 本文算法在保证鲁棒性能的同时提高了收敛速度, 并且在收敛速度和鲁棒性方面优于 核最小均方误差算法、核分式低次幂算法、核最小对数绝对差算法和核最小平均 p 范数算法

  • KLLAD 算法可以很好地处理异常值, 但存在 收敛速度慢的问题, 为了改进 KLLAD 算法的收敛 速度, 本文结合核最小对数绝对差算法和 p 范数, 提出了一种新的鲁棒核自适应滤波算法, 基于 p 范 数的核最小对数绝对差算法. 该算法在对数的基础上添加了 p 范 数, 通过 p 范数和一个正常数 a 来控制代价函数的 陡峭程度, 从而控制算法的收敛速度, 使该算法在 保证鲁棒性的基础上提升其收敛速度. 当背景噪声 为 a 稳定分布噪声时, 在非线性系统辨识和 MackeyGlass 混沌时间序列预测的仿真表明, 该算法的在 收敛速度和鲁棒性方面优于核最小均方算法、核分 式低次幂算法、核最小绝对差算法和核最小平均 p 范数算法

  • 综上, 本文的 P-KLLAD 算法虽牺牲了计算复 杂度, 但在非线性系统辨识和 Mackey-Glass 混沌 时间序列预测中不管是高斯噪声环境还是存在有 小的脉冲噪声的情况下均具有良好的脉冲噪声抑 制能力和较快的收敛速度

Read more

Summary

Introduction

非高斯冲激干扰下基于Softplus函数的核自适应滤波算法 Kernel adaptive filtering algorithm based on Softplus function under non-Gaussian impulse interference 物理学报. 混沌信号自适应协同滤波去噪 An adaptive denoising algorithm for chaotic signals based on collaborative filtering 物理学报. 为了进一步提高在 a 稳定分布噪声背景下非线性自适应滤波算法的收敛速度, 本文提出了一种新的基 于 p 范数的核最小对数绝对差自适应滤波算法 (kernel least logarithm absolute difference algorithm based on p-norm, P-KLLAD).

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call