2-D arithmetic Fourier transform using the Bruns method

Author

Atlas, Valery G. ; Atlas, Dmitry G. ; Bovbel, Evgeny I.

Author_Institution

International Acadamy of Philosophy, Obergass 75, Schaan, 9494 Liechtenstien

Volume

44

Issue

6

fYear

1997

fDate

6/1/1997 12:00:00 AM

Firstpage

546

Lastpage

551

Abstract

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

Keywords

Fourier series; Fourier transforms; VLSI; interpolation; 2D arithmetic Fourier transform; Bruns method; Fourier series; VLSI architecture; accuracy; complexity; even coefficients; odd coefficients; speed; Arithmetic; Circuits; Computational complexity; Computer architecture; Discrete Fourier transforms; Fast Fourier transforms; Fourier series; Fourier transforms; Interpolation; Very large scale integration;

fLanguage

English

Journal_Title

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Publisher

ieee

ISSN

1057-7122

Type

jour

DOI

10.1109/81.586028

Filename

586028