Windowed fractional Fourier transform on graphs: Properties and fast algorithm

Fang Jia Yan, Bing Zhao Li*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

A key challenge in the field of graph signal processing is to design proper transform methods to extract valuable information from signals on weighted graphs. This paper first defines convolution, translation and modulation operators in graph fractional domain, and proposes windowed graph fractional Fourier transform (WGFRFT). Related properties are proved. Then, a fast algorithm of WGFRFT is designed to increase flexibility. The robustness and superiority of the fast algorithm are verified via simulations with synthetic signals on graphs. Finally, an application to graph clustering is presented to show the practicability of WGFRFT.

Original languageEnglish
Article number103210
JournalDigital Signal Processing: A Review Journal
Volume118
DOIs
Publication statusPublished - Nov 2021

Keywords

  • Fast algorithm
  • Fractional Fourier transform
  • Graph signal processing
  • Windowed graph Fourier transform

Fingerprint

Dive into the research topics of 'Windowed fractional Fourier transform on graphs: Properties and fast algorithm'. Together they form a unique fingerprint.

Cite this