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
References
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
Login to access OSA Member Subscription
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 OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA 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 OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA Member Subscription
Metrics
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
Login to access OSA Member Subscription