Fourier transformation of rotationally invariant two-variable functions: Computer implementation of Hankel transform

Abstract

Computing the Fourier transform of a circularly symmetric function is often necessary in optics. Use of the 2-D FFT algorithm leads to loss of the symmetry because of the sampling and to a waste in storage requirements; to avoid these inconveniences, a 1-D algorithm is described using the Hankel transform of the section of the function.