The problem of calculating discrete Fourier transform in polar coordinate systems
which is called DPFT here
has been given considerable attention in many fields such as antenna
image registration and image retrieval.But the direct computation of DPFT is very time-consuming because of no X-Y separability.This paper proposes an improved fast 2D DPFT algorithm which aims at 2D real array data and can be realized by only 1D calculations.This decreases the overall computational complexity significantly and suits more for real-time signal processing.Compared with the direct calculation
the experimental results demonstrate the good performance of the proposed algorithm.