Fractional discrete Fourier transforms
Optics Letters, Vol. 21, Issue 18, pp. 1430-1432 (1996)
http://dx.doi.org/10.1364/OL.21.001430
Acrobat PDF (243 KB)
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
Citation
Zheng-Tao Deng, H. John Caulfield, and Marius Schamschula, "Fractional discrete Fourier transforms," Opt. Lett. 21, 1430-1432 (1996)
http://www.opticsinfobase.org/ol/abstract.cfm?URI=ol-21-18-1430
You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Log in to access OSA Member Subscription
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Log in to access OSA Member Subscription
You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Log in to access OSA Member Subscription
« Previous Article | Next Article »
OSA is a member of 