The fractional Fourier transform on graphs

Yi Qian Wang, Bing Zhao Li, Qi Yuan Cheng

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

21 Citations (Scopus)

Abstract

The emerging field of signal processing on graphs merges algebraic or spectral graph theory with discrete signal processing techniques to process signals on graphs. In this paper, a definition of the fractional Fourier transform on graphs (GFRFT) is proposed and consolidated, which extends the discrete fractional Fourier transform (DFRFT) in the same sense the graph Fourier transform (GFT) extends the discrete Fourier transform (DFT). The definition is based on the eigenvalue decomposition method of defining DFRFT, for it satisfies all the agreeable properties expected of the discrete fractional Fourier transform. Properties of the GFRFT are discussed, and examples of GFRFT of some graph signals are given to illustrate the transform.

Original languageEnglish
Title of host publicationProceedings - 9th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages105-110
Number of pages6
ISBN (Electronic)9781538615423
DOIs
Publication statusPublished - 2 Jul 2017
Event9th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2017 - Kuala Lumpur, Malaysia
Duration: 12 Dec 201715 Dec 2017

Publication series

NameProceedings - 9th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2017
Volume2018-February

Conference

Conference9th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2017
Country/TerritoryMalaysia
CityKuala Lumpur
Period12/12/1715/12/17

Fingerprint

Dive into the research topics of 'The fractional Fourier transform on graphs'. Together they form a unique fingerprint.

Cite this