Skip to main navigation Skip to search Skip to main content

New methods for fast computation of fractional Fourier transform

  • Xing Hao Zhao*
  • , Ran Tao
  • , Bing Deng
  • , Yue Wang
  • *Corresponding author for this work
  • Beijing Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

We present a FRFT high-resolution computation (zoom-FRFT) method, which can zoom-in on any interested portion of fractional spectrum by setting spectrum range and output number M. In addition, for solving lower efficiency of zoom-FRFT for small M, a FRFT single-point fast computation (SP-FRFT) method based on Homer rule is presented and its further reduction is made for zero-point computation. It can be used to increase computational efficiency for small M, and compute un-uniform output samples. Finally, two methods are verified by the simulations.

Original languageEnglish
Pages (from-to)1089-1093
Number of pages5
JournalTien Tzu Hsueh Pao/Acta Electronica Sinica
Volume35
Issue number6
Publication statusPublished - Jun 2007

Keywords

  • Decomposition-type algorithm
  • Fractional Fourier transform (FRFT)
  • High-resolution computation
  • Single-point fast computation

Fingerprint

Dive into the research topics of 'New methods for fast computation of fractional Fourier transform'. Together they form a unique fingerprint.

Cite this