FFTW is a free collection of fast C routines for computing the
Discrete Fourier Transform in one or more dimensions. It includes
complex, real, symmetric, and parallel transforms, and can handle
arbitrary array sizes efficiently. FFTW is typically faster than
other publically-available FFT implementations, and is even
competitive with vendor-tuned libraries. (See our web page for
This version of FFTW contains specific support for the Cell Broadband
Engine (``Cell'') processor.
The code in the cell/ directory was written and graciously donated to
the FFTW project by the IBM Austin Research Laboratory. We are
grateful to Pat Bohrer and Lorraine Herger of IBM for this generous
Cell consists of one PowerPC core (`
This directory contains files that are specific to the SIMD
implementation but are not DFT- or RDFT- specific.
This directory contains a benchmarking and testing program
The `bench' program has a zil
* Improve performance of some copy operations of complex arrays on
Sun Jul 12 06:34:46 EDT 2009 email@example.com
* Update NEWS, version number for 3.2.2 release.
TODO before FFTW-$2\pi$:
* DCT/DST codelets? which kinds?
* investigate the addition-chain trig c
Authors of FFTW (reachable at firstname.lastname@example.org):
Matteo Frigo <email@example.com>
Stevenj G. Johnson <st
Browse inside fftw3_3.2.2.orig.tar.gz
Results 1 - 1 of 1Search over 15 billion files
© 1997-2017 FileWatcher.com