2-D arithmetic Fourier transform using the Bruns method

The arithmetic Fourier transform (AFT) has been shown to perform competitively with the classical fast Fourier transform (FFT) in terms of accuracy, complexity, and speed. The new technique of calculating AFT based upon Bruns' method proved to be an advancement of the previous version of the arithmetic transformation, since it provides a more balanced scheme of computation of the even and odd coefficients of a Fourier series. This brief develops the concept of two-dimensional AFT using the Bruns method. A VLSI architecture is suggested for the proposed two-dimensional AFT algorithm.