A FAST ALGORITHM FOR FRACTIONAL FOURIER-TRANSFORMS

Citation
Xg. Deng et al., A FAST ALGORITHM FOR FRACTIONAL FOURIER-TRANSFORMS, Optics communications, 138(4-6), 1997, pp. 270-274
Citations number
26
Categorie Soggetti
Optics
Journal title
ISSN journal
00304018
Volume
138
Issue
4-6
Year of publication
1997
Pages
270 - 274
Database
ISI
SICI code
0030-4018(1997)138:4-6<270:AFAFFF>2.0.ZU;2-O
Abstract
A fast algorithm for numerical calculation of arbitrary real order of fractional Fourier transforms is presented. Its computation complexity is comparable to that of fast convolution Fourier transform. Furtherm ore, it allows one to freely choose the sampling resolutions in both x - and u-space under the restriction of the Nyquist sampling theorem.