DMCA
FFTW: An Adaptive Software Architecture For The FFT (1998)
Cached
Download Links
| Citations: | 602 - 4 self |
BibTeX
@INPROCEEDINGS{Frigo98fftw:an,
author = {Matteo Frigo and Steven G. Johnson},
title = {FFTW: An Adaptive Software Architecture For The FFT},
booktitle = {},
year = {1998},
pages = {1381--1384},
publisher = {IEEE}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
FFT literature has been mostly concerned with minimizing the number of floating-point operations performed by an algorithm. Unfortunately, on present-day microprocessors this measure is far less important than it used to be, and interactions with the processor pipeline and the memory hierarchy have a larger impact on performance. Consequently, one must know the details of a computer architecture in order to design a fast algorithm. In this paper, we propose an adaptive FFT program that tunes the computation automatically for any particular hardware. We compared our program, called FFTW, with over 40 implementations of the FFT on 7 machines. Our tests show that FFTW's self-optimizing approach usually yields significantly better performance than all other publicly available software. FFTW also compares favorably with machine-specific, vendor-optimized libraries. 1. INTRODUCTION The discrete Fourier transform (DFT) is an important tool in many branches of science and engineering [1] and...
Keyphrases
adaptive software architecture discrete fourier transform memory hierarchy computer architecture many branch important tool fft literature particular hardware present-day microprocessor vendor-optimized library floating-point operation self-optimizing approach adaptive fft program fast algorithm processor pipeline available software
