Analysis and comparison of discrete fractional fourier transforms

  • Xinhua Su
  • , Ran Tao*
  • , Xuejing Kang
  • *Corresponding author for this work

Research output: Contribution to journalReview articlepeer-review

62 Citations (Scopus)

Abstract

The fractional Fourier transform (FRFT) is a powerful tool for time-varying signal analysis. There exist various discrete fractional Fourier transforms (DFRFTs); in this paper, we systematically analyze and compare the main DFRFT types: sampling-type DFRFTs and eigenvector decomposition-type DFRFTs. First, for the existing sampling-type DFRFTs, we perform concrete analyses and comparisons of their applicable conditions and then establish their equivalence relationship. Then, for various eigenvector decomposition-type DFRFTs, their common mechanisms are extracted and thus they are effectively classified. In addition, as the extended version of DFRFTs, discrete counterparts of the linear canonical transform (LCT) and simplified FRFT (SFRFT) are summarized and classified. Our work is instructive for research about the choice of a more appropriate DFRFT in different applications, which is also supported by simulation experiments. Finally, for the DFRFT, DLCT and DSFRFT, two applications regarding detection for chirp signals and optical imaging are investigated to intuitively analyze their differences.

Original languageEnglish
Pages (from-to)284-298
Number of pages15
JournalSignal Processing
Volume160
DOIs
Publication statusPublished - Jul 2019

Keywords

  • Commuting matrices
  • Eigenvector decomposition
  • Fractional fourier transform
  • Linear canonical transform

Fingerprint

Dive into the research topics of 'Analysis and comparison of discrete fractional fourier transforms'. Together they form a unique fingerprint.

Cite this