Skip to main navigation Skip to search Skip to main content

Fast algorithm of discrete gyrator transform based on convolution operation

  • Zhengjun Liu*
  • , Dezhi Chen
  • , Jinpeng Ma
  • , Shuyi Wei
  • , Yanli Zhang
  • , Jingmin Dai
  • , Shutian Liu
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

The expression of gyrator transform (GT) is rewritten by using convolution operation, from which GT can be composed of phase-only filtering, Fourier transform and inverse Fourier transform. Therefore, fast Fourier transform (FFT) algorithm can be introduced into the calculation of convolution format of GT in the discrete case. Some simulations are presented in order to demonstrate the validity of the algorithm.

Original languageEnglish
Pages (from-to)864-867
Number of pages4
JournalOptik
Volume122
Issue number10
DOIs
StatePublished - May 2011

Keywords

  • Fourier transform
  • Gyrator transform

Fingerprint

Dive into the research topics of 'Fast algorithm of discrete gyrator transform based on convolution operation'. Together they form a unique fingerprint.

Cite this