D7.8 FOURIER ANALYSIS USING ADAPTIVE AFT
Weiping Li · 1990
The arithmetic Fourier transform (AFT) is a computationally efficient technique for Fourier analysis. It doesn't need any multiplications of twiddle factors but it requires O(N2) time domain samples for computing hi frequency components. In this paper, a solution to this problem is proposed. By using an iterative algorithm with the AFT, we can use the Nyquist sampling rate in the time domain and obtain O(N2) samples in the frequency domain. Simulation result of the algorithm is included.