Direct calculation of fractional Fourier transforms from the expressions derived for their optical implementation is laborious. An extension of the discrete Fourier transform would have only O(N2) computational complexity. We define such a system, offer a general way to compute the fractional discrete Fourier transform matrix, and numerically validate the algorithm.
© 1996 Optical Society of America
Original Manuscript: May 10, 1996
Published: September 15, 1996
Zheng-Tao Deng, H. John Caulfield, and Marius Schamschula, "Fractional discrete Fourier transforms," Opt. Lett. 21, 1430-1432 (1996)