Share Email Print
cover

Proceedings Paper

Improved fast polar Fourier transform algorithm
Author(s): Mankun Xu; Xijian Ping
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of calculating the discrete Fourier tranform (DFT) acquired in polar coordinate system has been given considerably attention in many fields such as antenna, image registration and tomography. This paper proposes an improved fast DPFT algorithm aiming at 2D real data. In this paper, a Conjugated-like property of the conjugated sequences' Chirp-Z transform (CZT) in symmetric frequency section is proved which saves half of the computational complexity in CZT. The algorithm is suitable for real-time applications by only 1D calcuations in which the most steps are 1D FFT. The experimental results show the applicability and good performance of this approach.

Paper Details

Date Published: 25 September 2003
PDF: 4 pages
Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); doi: 10.1117/12.538986
Show Author Affiliations
Mankun Xu, Zhengzhou Univ. of Information Engineering (China)
Xijian Ping, Zhengzhou Univ. of Information Engineering (China)


Published in SPIE Proceedings Vol. 5286:
Third International Symposium on Multispectral Image Processing and Pattern Recognition
Hanqing Lu; Tianxu Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top