Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm

Abstract

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT’s in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from −1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.

© 1996 Optical Society of America

Numerical calculation of fractional Fourier transforms with a single fast-Fourier-transform algorithm

Francisco J. Marinho and Luı́s M. Bernardo
J. Opt. Soc. Am. A 15(8) 2111-2116 (1998)

Fast numerical algorithm for the linear canonical transform

Bryan M. Hennelly and John T. Sheridan
J. Opt. Soc. Am. A 22(5) 928-937 (2005)

Extended fractional Fourier transforms

Jianwen Hua, Liren Liu, and Guoqiang Li
J. Opt. Soc. Am. A 14(12) 3316-3322 (1997)

Improved fast fractional-Fourier-transform algorithm

Xingpeng Yang, Qiaofeng Tan, Xiaofeng Wei, Yong Xiang, Yingbai Yan, and Guofan Jin
J. Opt. Soc. Am. A 21(9) 1677-1681 (2004)

Generalizing, optimizing, and inventing numerical algorithms for the fractional Fourier, Fresnel, and linear canonical transforms

Bryan M. Hennelly and John T. Sheridan
J. Opt. Soc. Am. A 22(5) 917-927 (2005)