Kernel Adaptive Filtering Algorithm Based on Hyperbolic Tangent Mixed Error Function

This paper proposes an adaptive filtering algorithm based on the symmetry Kernel Hyperbolic Tangent Mixed Error Criterion (KHTMC), aimed at addressing the identification of nonlinear systems under non-Gaussian noise environments. The algorithm optimizes signal processing by constructing a mixed cost function that combines the symmetry logarithmic square error and the hyperbolic tangent function and integrates it with the kernel adaptive filtering method. Simulation results show that, compared to existing kernel adaptive filtering algorithms, the KHTMC algorithm exhibits significant advantages in terms of convergence speed and steady-state mean square error. It demonstrates strong robustness and tracking performance, especially when dealing with mixed non-Gaussian noise. Therefore, this algorithm shows great potential in signal processing applications under complex noise conditions, offering a more reliable and efficient solution.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2024-12-07
DOI
https://doi.org/10.3390/sym16121624
Primary Topic
Advanced Adaptive Filtering Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kernel Adaptive Filtering Algorithm Based on Hyperbolic Tangent Mixed Error Function

Yongbing Hu, Yong Chen, Chenchong Bi
Symmetry
Advanced Adaptive Filtering Techniques
article

Kernel Adaptive Filtering Algorithm Based on Hyperbolic Tangent Mixed Error Function

Yongbing Hu, Yong Chen, Chenchong Bi
article en

Abstract

This paper proposes an adaptive filtering algorithm based on the symmetry Kernel Hyperbolic Tangent Mixed Error Criterion (KHTMC), aimed at addressing the identification of nonlinear systems under non-Gaussian noise environments. The algorithm optimizes signal processing by constructing a mixed cost function that combines the symmetry logarithmic square error and the hyperbolic tangent function and integrates it with the kernel adaptive filtering method. Simulation results show that, compared to existing kernel adaptive filtering algorithms, the KHTMC algorithm exhibits significant advantages in terms of convergence speed and steady-state mean square error. It demonstrates strong robustness and tracking performance, especially when dealing with mixed non-Gaussian noise. Therefore, this algorithm shows great potential in signal processing applications under complex noise conditions, offering a more reliable and efficient solution.

SymmetryVol. 16(12)
Anhui University (CN)
Openalex Percentile: Top 75%
Advanced Adaptive Filtering Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Kernel Adaptive Filtering Algorithm Based on Hyperbolic Tangent Mixed Error Function — Yongbing Hu, Yong Chen, et al. · Symmetry (2024) | TGRS Research Map | TGRS