Abstract

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

Diffraction analysis of rotationally symmetric optical systems using computer-generated aberration polynomials

S. C. Tam, G. D. W. Lewis, S. Doric, and D. Heshmaty-Manesh
Appl. Opt. 22(8) 1181-1187 (1983)

Calculations of optical field by fast Fourier transform analysis

Seiji Nishiwaki
Appl. Opt. 27(16) 3518-3521 (1988)

Orthogonal basis for the optical transfer function

Chelo Ferreira, José L. López, Rafael Navarro, and Ester Pérez Sinusa
Appl. Opt. 55(34) 9688-9694 (2016)

Verification and comparison of a fast Fourier transform-based full diffraction method for tilted and offset planes

Nuri Delen and Brian Hooker
Appl. Opt. 40(21) 3525-3531 (2001)

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)