A New Approach for Implementing the Arithmetic Fourier Transform (AFT)

  • Authors:

  • Xianchao Zhang;Yingyu Wan;Guoliang Chen

  • Affiliations:

  • -;-;-

  • Venue:
  • HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The arithmetic Fourier transform (AFT) is an important Fourier analysis technique. Since AFT algorithms require many non-uniform samples, zero-order interpolation is used for implementing AFT. But this method can produce significant errors. To reduce the errors, over-sampling is needed, meaning the sampling rate should be a number of times the Nyquist rate. The over-sampling problem is the main drawback of AFT. In this paper, a new method for implementing AFT with no need of over-sampling is presented. This method gains nearly the same effect as the method using over-sampling, so it makes it possible for us to implement AFT with sampling at the Nyquist rate.