betaFeedback

WorksEngineering

Least ln-cosh-based adaptive filtering algorithm for graph signal processing

Abstract

Currently, an increasing number of irregular signals are being defined within graph structures. This paper proposes a Least ln-cosh-based Adaptive Filtering for Graph Signal Processing (GSP LLAF) algorithm for offline/online graph signal estimation under various non-Gaussian noise conditions. Compared to the recently proposed Graph Adaptive Least Mean p-th Power (GSP LMP) algorithm, GSP LLAF eliminates the need for prior knowledge of the noise characteristics. Simultaneously, GSP LLAF addresses the limitation in estimation accuracy encountered by the Sign Algorithm for Graph Signal Processing (GSP Sign) and the Graph Signal Processing algorithm based on the Generalized Maximum Correntropy Criterion (GSP GMCC). Furthermore, the algorithm features low computational complexity and fast execution speed. To achieve a balance between convergence speed and estimation accuracy, a variable step-size variant, the Modified Variable Step-Size Least ln-cosh-based Adaptive Filtering Algorithm for Graph Signal Processing (GSP MVSS-LLAF), is proposed. In estimation experiments involving both static and time-varying graph signals, the proposed GSP LLAF and GSP MVSS-LLAF algorithms demonstrate fast, stable, and robust graph signal estimation performance under various non-Gaussian noise conditions, including Bernoulli-Gaussian (BG) modeled impulse noise, as well as alpha-stable, Cauchy, and Laplace distributions.

Paper details

vlnc:W_4kwkkj2p
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…