FFTW, for "Fastest Fourier Transform in the West," is a software library for computing discrete Fourier transforms (DFTs), developed by Matteo Frigo and Steven G. Johnson at the MIT Laboratory for Computer Science.

PropertyValue
dbpedia-owl:Software#developer
dbpedia-owl:Software#language
dbpedia-owl:Software#license
dbpedia-owl:Work#genre
p:abstract
  • FFTW, for "Fastest Fourier Transform in the West," is a software library for computing discrete Fourier transforms (DFTs), developed by Matteo Frigo and Steven G. Johnson at the MIT Laboratory for Computer Science. FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm. It can compute transforms of real- and complex-valued arrays of arbitrary size and dimension in O(n log n) time. It does this by supporting a variety of algorithms and choosing the one it estimates or measures to be preferable in the particular circumstances. It works best on arrays of sizes with small prime factors, with powers of two being the optimal size and a (large) prime size being the worst case. For a sufficiently large number of repeated transforms it is advantageous to use FFTWs ability to choose the fastest algorithm by actually measuring the performance of (some or all of) the supported algorithms on the given array size and platform. These measurements, which the authors call wisdom can be stored in a file or string for later use. FFTW has a guru interface, that intends to expose as much as possible of the flexibility in the underlying FFTW architecture. This allows among other things multi-dimensional transforms and multiple transforms in a single call (e.g. where the data is interleaved in memory). FFTW has limited support for Out of order transforms (using the MPI version). The data reordering incurs an overhead, which for in-place transforms of arbitrary size and dimension is non-trivial to avoid. It is undocumented for which transforms this overhead is significant. FFTW is licensed under the GNU General Public License. It is also licensed commercially by MIT and is used in the commercial Matlab matrix package for calculating Fast Fourier Transforms (FFTs) - that is, the Matlab functions which compute FFTs are actually based on FFTW. FFTW is written in the C language, but Fortran and Ada interfaces exist, as well as interfaces for a few other languages. While the library itself is C, the code is actually generated from a program called 'genfft', which is written in Objective Caml. In 1999, FFTW won the J. H. Wilkinson Prize for Numerical Software. There has been some controversy concerning the benchmarks used to determine the speed of FFTW, spurred by Daniel J. Bernstein, the author of the FFT library djbfft. The djbfft library itself is mostly of historical interest only, as it has not been updated to take advantage of recent SIMD instruction sets, does not[http://projects.scipy.org/pipermail/scipy-dev/2002-August/001108.html] come with a license beyond the permission given in the FAQ to "use it in your own code", and is limited to 1D out of order transforms and small power of 2 lengths. (en)
  • FFTW (Fastest Fourier Transform in the West) to bardzo szybka biblioteka transformat Fouriera. FFTW jest rzeczywiście najszybszą niezależną od sprzętu biblioteką tego typu. Inne biblioteki o porównywalnych osiagnięciach składają się z ręcznie optymalizowanego kodu asemblerowego. Z FFTW jest inaczej - większość kodu FFTW jest generowana z zapisu w języku Ocaml, ponadto FFTW w czasie rzeczywistym dostosowuje się do właściwości danej maszyny - nie tylko procesora ale również wykorzystuje cechy pamięci cache. FFTW jest biblioteką języka C, ale można jej używać także z Fortrana i C++. Istnieją wersje FFTW dla SMP, a nawet dla obliczeń rozproszonych. FFTW od wersji 1.3 jest dostępna na licencji GPL (wcześniej była darmowa dla użytku niekomercyjnego); autorzy umożliwiają również uzyskania FFTW na innej, nie-wolnej licencji. Programy używające FFTW to między innymi GNU Octave. Informacje techniczne: * najnowsza wersja to 3.2 alpha2 (dodana 19 marca 2007) * pakiety Debiana: ** Wersja normalna - fftw2 i fftw-dev ** Wersja o pojedynczej precyzji - sfftw i sfftw-dev ** Wersja zoptymalizowana dla AMD K6-2 - k6fftwgel i k6fftwgel-dev ** Wersja zoptymalizowana dla AMD K7 - k7fftwgel i k7fftwgel-dev ** Wersja zoptymalizowana dla Pentium 4 - p4fftwgel i p4fftwgel-dev (pl)
p:date
  • 2008-03-01 00:00:00.000000 (xsd:date)
p:developer
p:genre
p:hasPhotoCollection
p:language
p:latestReleaseDate
  • 2006-07-05 (xsd:date)
p:latestReleaseVersion
  • 3.1.2 (en)
p:license
  • GPL, commercial (en)
p:name
  • FFTW (en)
p:reference
p:website
p:wikiPageUsesTemplate
p:wikipage-pl
p:wordnet_type
rdf:type
rdfs:comment
  • FFTW, for "Fastest Fourier Transform in the West," is a software library for computing discrete Fourier transforms (DFTs), developed by Matteo Frigo and Steven G. Johnson at the MIT Laboratory for Computer Science. (en)
  • FFTW (Fastest Fourier Transform in the West) to bardzo szybka biblioteka transformat Fouriera. (pl)
rdfs:label
  • FFTW (en)
  • FFTW (pl)
owl:sameAs
skos:subject
foaf:homepage
foaf:page
owl:sameAs