Abstract
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
Full Article | PDF ArticleMore Like This
Soo-Chang Pei and Min-Hung Yeh
Opt. Lett. 22(14) 1047-1049 (1997)
Kurt Bernardo Wolf and Guillermo Krötzsch
J. Opt. Soc. Am. A 24(3) 651-658 (2007)
Javier García, David Mas, and Rainer G. Dorsch
Appl. Opt. 35(35) 7013-7018 (1996)