Although fast Fourier transform (FFT) algorithms based on the Cooley-Tukey method have been widely used for the computation of optical transfer function (OTF), the need for yet faster algorithms remains. This is particularly so since desk-top computers with modest speed and memory size have become essential tools in optical design. In this paper we report on the application of a new FFT algorithm, first described by Winograd, to the calculation of diffraction OTF. The algorithm is compared both in speed and in accuracy with the commonly used radix-2 FFT and with an autocorrelation method employing the Gaussian quadrature integration technique. It is found that the new algorithm yields the same accuracy as that obtained by the Cooley-Tukey method but is up to four times faster. Some other advantages and drawbacks are discussed.

© 1982 Optical Society of America

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