This paper presents an algorithm to compute the two-dimensional Fourier transform samples of circularly symmetric functions. Using the Fourier-Bessel expansion for the finite interval functions expressed in polar form, the Fourier transform samples are obtained with less storage and computational requirements than when using the 2-D FFT algorithm [4].
Published in:
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.
(Volume:10
)
Date of Conference: Apr 1985