Distributed Nonlinear Polynomial Adaptive Graph Filter Based on Diffusion Conjugate Gradient Strategy

doi:10.1109/TCSII.2023.3307698

Distributed Nonlinear Polynomial Adaptive Graph Filter Based on Diffusion Conjugate Gradient Strategy

2024-02-01

5

PRE

AI

DOI：10.1109/TCSII.2023.3307698

Original

Original request for help

Save

Abstract

En 中文

This brief investigates distributed and adaptive estimation of streaming data based nonlinear graph filters. To begin with, a new distributed polynomial filter for nonlinear graphs is proposed based on the Hadamard product, which not only represents the nonlinear relationship between dynamically changing graph input and output signals, but also accounts for the time dimension. A diffusion least mean square algorithm is presented to estimate the nonlinear polynomial graph filter parameters in a distributed manner. The method of diffusion hybrid conjugate gradient is leveraged to further improve the convergence rate of the graph diffusion adaptive filter. The advantages of the proposed algorithms are demonstrated in simulation studies.

Keywords:

Adaptive filters

Filtering algorithms

Finite impulse response filters

Filtering theory

IIR filters

Heuristic algorithms

Convergence

Nonlinear graph filter

diffusion LMS

conjugate gradient

graph signal processing

Distributed Nonlinear Polynomial Adaptive Graph Filter Based on Diffusion Conjugate Gradient Strategy

Abstract

Journal

Organization