Diffusion approximated kernel least mean P-power algorithm

Wei Gao, Jie Chen, Lingling Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Considering nonlinear and non-Gaussian environments that are frequently encountered in real-world scenarios, we thus propose the approximated kernel least mean p-power (AKLM-P) algorithm to address these tough factors for nonlinear distributed systems. In order to efficiently devise this algorithm, we use the property of shift-invariant kernel function that can be approximated by random Fourier features, and consider the impulsive noise characterized by the α-stable distribution. The stability in the mean of proposed distributed algorithm is then studied. Finally, the superiorities of proposed approach compared to diffusion kernelleast-mean-square (KLMS) algorithm are confirmed via the experimental results.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728117072
DOIs
StatePublished - Sep 2019
Event2019 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2019 - Dalian, Liaoning, China
Duration: 20 Sep 201922 Sep 2019

Publication series

Name2019 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2019

Conference

Conference2019 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2019
Country/TerritoryChina
CityDalian, Liaoning
Period20/09/1922/09/19

Keywords

  • Distributed diffusion
  • Impulsive noise
  • Kernel least mean p-power
  • Random Fourier features
  • Stability analysis

Fingerprint

Dive into the research topics of 'Diffusion approximated kernel least mean P-power algorithm'. Together they form a unique fingerprint.

Cite this