Back to Results
First PageMeta Content
Fast Fourier transform / FFTW / Directed acyclic graph / Discrete Fourier transform / Cooley–Tukey FFT algorithm / Mathematical analysis / Digital signal processing / Mathematics


A Fast Fourier Transform Compiler Matteo Frigo MIT Laboratory for Computer Science 545 Technology Square NE43-203 Cambridge, MA 02139 
Add to Reading List

Document Date: 2003-06-06 13:30:10


Open Document

File Size: 177,71 KB

Share Result on Facebook

City

Atlanta / Haifa / Cambridge / /

Company

Digital Equipment Corporation / Fourier Transform Compiler Matteo Frigo MIT Laboratory / /

Facility

FFTW library / The FFTW library / Sun’s Performance Library / /

IndustryTerm

real-world applications / recursive algorithm / machinery / linear network / linear networks / cache-oblivious algorithm / divide-and-conquer cache-oblivious algorithms / /

OperatingSystem

Linux / /

Organization

Defense Advanced Research Projects Agency / MIT / /

Person

Steven G. Johnson / Joanna Kulik / /

Position

Haifa scheduler / author / scheduler / /

ProgrammingLanguage

Cilk / Objective Caml / C / /

ProvinceOrState

Manitoba / Georgia / Massachusetts / /

Technology

cache-oblivious FFT algorithm / DFT algorithm / 167 MHz UltraSPARC processor / existing processor / real DFT algorithm / divide-and-conquer cache-oblivious algorithms / CSE algorithm / involved DFT algorithm / cache-oblivious algorithm / Linux / Cooley-Tukey algorithm / caching / FFT algorithms / same algorithm / shared memory / recursive algorithm / /

SocialTag