Benchmarking of FFT algorithms

Author

Balducci, Miclzirel ; Ganapathiraju, A. ; Hamaker, Jonathan ; Picone, Joseph ; Choudary, A. ; Skjellum, Anthony

Author_Institution

Dept. of Electr. & Comput. Eng., Mississippi State Univ., MS, USA

fYear

1997

fDate

12-14 Apr 1997

Firstpage

328

Lastpage

330

Abstract

A large number of fast Fourier transform (FFT) algorithms have been developed over the years. Among these, the most promising are the radix-2, radix-4, split-radix, fast Hartley transform (FHT), quick Fourier transform (QFT), and the decimation-in-time-frequency (DITF) algorithms. We present a rigorous analysis of these algorithms that includes the number of mathematical operations, computational time, memory requirements, and object code size. The results of this work will serve as a framework for creating an object-oriented, poly-functional FFT implementation which will automatically choose the most efficient algorithm given user-specified constraints

Keywords

Hartley transforms; computational complexity; digital arithmetic; fast Fourier transforms; object-oriented programming; signal processing; time-frequency analysis; DITF; FFT algorithms; FHT; QFT; computational time; decimation-in-time-frequency; fast Fourier transform; fast Hartley transform; mathematical operations; memory requirements; object code size; object oriented FFT implementation; polyfunctional FFT implementation; quick Fourier transform; radix-2 algorithm; radix-4 algorithm; signal processing; split-radix; user-specified constraints; Algorithm design and analysis; Computer architecture; Computer science; Discrete Fourier transforms; Discrete cosine transforms; Fast Fourier transforms; Flexible printed circuits; Fourier transforms; Object oriented programming; Statistics;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '97. Engineering new New Century., Proceedings. IEEE

Conference_Location

Blacksburg, VA

Print_ISBN

0-7803-3844-8

Type

conf

DOI

10.1109/SECON.1997.598704

Filename

598704