An Exact and Fast Computation of Discrete Fourier Transform for Polar and Spherical Grid

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Syed Alam Abbas, Qiyu Sun, Hassan Foroosh
Journal/Conference Name IEEE Transactions on Signal Processing
Paper Category
Paper Abstract Numerous applied problems of two-dimensional (2-D) and 3-D imaging are formulated in continuous domain. They place great emphasis on obtaining and manipulating the Fourier transform in polar and spherical coordinates. However, the translation of continuum ideas with the discrete sampled data on a Cartesian grid is problematic. There exists no exact and fast solution to the problem of obtaining discrete Fourier transform for polar and spherical grids in the literature. In this paper, we develop exact algorithms to the above problem for 2-D and 3-D, which involve only 1-D equispaced fast Fourier transform with no interpolation or approximation at any stage. The result of the proposed approach leads to a fast solution with very high accuracy. We describe the computational procedure to obtain the solution in both 2-D and 3-D, which includes fast forward and inverse transforms. We find the nested multilevel matrix structure of the inverse process, and we propose a hybrid grid and use a preconditioned conjugate gradient method that exhibits a drastic improvement in the condition number.
Date of publication 2016
Code Programming Language Matlab

Copyright Researcher 2022