Generalized Maximum Correntropy Algorithm with Affine Projection Based on Sigmoid Cost Function

The affine projection algorithm based on generalized maximum correlation entropy is widely used due to its high robustness. However, it is difficult to be applied in the field of echo cancellation because of its poor robustness performance in sparse systems. In this paper, in order to improve the robustness of such algorithms in sparse systems, the sigmoid generalized maximum correlation entropy affine projection algorithm (SAPGMC) is proposed by invoking the improved sigmoid activation function as the cost function, which reduces the influence of impulse interference in sparse systems, and at the same time, a l1J-paradigm penalty term is added to the algorithm, so that the algorithm can be successfully applied to the field of echo cancellation. The simulation results demonstrate the superiority of the algorithm's performance in sparse systems.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1109/eiecs63941.2024.10800343
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized Maximum Correntropy Algorithm with Affine Projection Based on Sigmoid Cost Function

Shifeng Ou, Ying Gao, Jia Mu, Haorui Li
Matrix Theory and Algorithms
article

Generalized Maximum Correntropy Algorithm with Affine Projection Based on Sigmoid Cost Function

Shifeng Ou, Ying Gao, Jia Mu, Haorui Li
article en

Abstract

The affine projection algorithm based on generalized maximum correlation entropy is widely used due to its high robustness. However, it is difficult to be applied in the field of echo cancellation because of its poor robustness performance in sparse systems. In this paper, in order to improve the robustness of such algorithms in sparse systems, the sigmoid generalized maximum correlation entropy affine projection algorithm (SAPGMC) is proposed by invoking the improved sigmoid activation function as the cost function, which reduces the influence of impulse interference in sparse systems, and at the same time, a l1J-paradigm penalty term is added to the algorithm, so that the algorithm can be successfully applied to the field of echo cancellation. The simulation results demonstrate the superiority of the algorithm's performance in sparse systems.

Yantai University (CN)
Openalex Percentile: Top 71%
Matrix Theory and Algorithms
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.

Generalized Maximum Correntropy Algorithm with Affine Projection Based on Sigmoid Cost Function — Shifeng Ou, Ying Gao, et al. · (2024) | TGRS Research Map | TGRS