Fourier analysis using adaptive AFT
Weiqi Li · International Conference on Acoustics, Speech, and Signal Processing · 2002
The arithmetic Fourier transform (AFT) is a computationally efficient technique for Fourier analysis. It does not need any multiplication of twiddle factors, but it requires O(N/sup 2/) time-domain samples for computing N frequency components. A solution to this problem is proposed. By using an iterative algorithm with the AFT, it is possible to use the Nyquist sampling rate in the time domain and obtain O(N/sup 2/) samples in the frequency domain. Simulation results for the algorithm are included. >