A platform for research: civil engineering, architecture and urbanism
An improved fast Fourier transform in polar coordinate system
The problem of calculating the discrete Fourier transform (DFT) acquired in polar coordinate system has been given considerable attention in many fields during the last 40 years such as antenna, image registration, tomography. etc. Unlike DFT, the discrete polar Fourier transform (DPFT) has no X-Y separability and can't be directly computed by fast Fourier transform (FFT). This paper proposes an improved fast DPFT algorithm aiming at 2D real array data. By utilizing the properties of the shift discrete Fourier transform (SDFT) and the chirp-Z transform (CZT), the algorithm's overall computational complexity is significantly decreased and is more suitable for real-time applications by only 1D calculations. The experimental results demonstrate the applicability and good performance of this approach.
An improved fast Fourier transform in polar coordinate system
The problem of calculating the discrete Fourier transform (DFT) acquired in polar coordinate system has been given considerable attention in many fields during the last 40 years such as antenna, image registration, tomography. etc. Unlike DFT, the discrete polar Fourier transform (DPFT) has no X-Y separability and can't be directly computed by fast Fourier transform (FFT). This paper proposes an improved fast DPFT algorithm aiming at 2D real array data. By utilizing the properties of the shift discrete Fourier transform (SDFT) and the chirp-Z transform (CZT), the algorithm's overall computational complexity is significantly decreased and is more suitable for real-time applications by only 1D calculations. The experimental results demonstrate the applicability and good performance of this approach.
An improved fast Fourier transform in polar coordinate system
Mankun Xu, (author) / Xijian Ping, (author)
2003-01-01
282257 byte
Conference paper
Electronic Resource
English
An Improved Fast Fourier Transform in Polar Coordinate System
British Library Conference Proceedings | 2003
|Diskrete Fourier-Transformation und Fast Fourier Transform
Springer Verlag | 2017
|Probability Analysis Method Using Fast Fourier Transform
British Library Conference Proceedings | 1996
|Fast fourier transform using the PDP-11
TIBKAT | 1972
|Solving Molodensky’s series by fast Fourier transform techniques
Online Contents | 1986
|