2-D arithmetic Fourier transform algorithm
Qian Huisheng, Li Ping · 2002
The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT. A 2-D AFT algorithm using same method is developed on the basis of a 1-D AFT algorithm. The analysis of the complexity and the architecture of the 2-D AFT algorithm shows that 2-D AFT can also perform competitively with the classical 2-D FFT in terms of complexity and speed. Finally, a computer simulation shows the correction of this algorithm.