Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Fractional discrete Fourier transforms

Not Accessible

Your library or personal account may give you access

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 Article
More Like This
Improved discrete fractional Fourier transform

Soo-Chang Pei and Min-Hung Yeh
Opt. Lett. 22(14) 1047-1049 (1997)

Geometry and dynamics in the fractional discrete Fourier transform

Kurt Bernardo Wolf and Guillermo Krötzsch
J. Opt. Soc. Am. A 24(3) 651-658 (2007)

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

Javier García, David Mas, and Rainer G. Dorsch
Appl. Opt. 35(35) 7013-7018 (1996)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (31)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved