free society. We build this foundation.
With your help, we will raise $450,000 this
winter to make this foundation even stronger.
Donate today, and build us up for 2014.
C subroutine library for computing the Discrete Fourier Transform in one or more dimensions, of both real and complex data, and of arbitrary input size. The FFTW team's benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. However, FFTW appears to be the fastest program most of the time for in-order transforms, especially in the multi-dimensional and real-complex cases.
DocumentationUser manual included
released on 22 December 2008
|License||Verified by||Verified on||Notes|
|GPLv2||Kelly Hopkins||22 December 2008|
|GPLv2orlater||Kelly Hopkins||22 December 2008|
Leaders and contributors
|Steven G. Johnson||Maintainer|
Resources and communication
This entry (in part or in whole) was last reviewed on 7 January 2008.