4.5 Article

Fast algorithm of discrete gyrator transform based on convolution operation

Journal

OPTIK
Volume 122, Issue 10, Pages 864-867

Publisher

ELSEVIER GMBH, URBAN & FISCHER VERLAG
DOI: 10.1016/j.ijleo.2010.06.010

Keywords

Fourier transform; Gyrator transform

Categories

Funding

  1. National Natural Science Foundation of China [10974039, 10674038, 10604042]
  2. China Postdoctoral Science Foundation [20080430913, 200902409]
  3. Harbin Institute of Technology [HITQNJS. 2008. 027]
  4. Fundamental Research Funds for the Central Universities [HIT.NSRIF.2009038]
  5. National Basic Research Program of China [2006CB302901]

Ask authors/readers for more resources

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. (C) 2010 Elsevier GmbH. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available