Fast algorithm of discrete gyrator transform based on convolution operation

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.