FFTW
- FFTW
-
FFTW (signifiant Fastest Fourier Transform in the West, soit Transformée de Fourier la plus rapide de l'Ouest) est une bibliothèque informatique calculant des transformées de Fourier discrète, développée par Matteo Frigo et Steven G. Johnson au Massachusetts Institute of Technology.
FFTW est utilisé par MATLAB pour les calculs de transformées de Fourier.
En 1999, FFTW a gagné le Prix J. H. Wilkinson pour le logiciel numérique.
Sources
Liens externes
Wikimedia Foundation.
2010.
Contenu soumis à la licence CC-BY-SA. Source : Article FFTW de Wikipédia en français (auteurs)
Regardez d'autres dictionnaires:
FFTW — Infobox Software name = FFTW logo = caption = author = developer = Matteo Frigo and Steven G. Johnson released = latest release version = 3.1.2 latest release date = 5 July 2006 latest preview version = latest preview date = operating system =… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
OCaml — Objective Caml Apparu en 1987 (CAML), 1996 (OCaml) Développeur INRIA Dernière version stable … Wikipédia en Français
Objective Caml — Apparu en 1987 (CAML), 1996 (OCaml) Développeur INRIA Dernière version stable 3.11.1 (le 12 … Wikipédia en Français
Ocaml — Objective Caml Apparu en 1987 (CAML), 1996 (OCaml) Développeur INRIA Dernière version stable 3.11.1 (le 12 … Wikipédia en Français
O’Caml — Objective Caml Apparu en 1987 (CAML), 1996 (OCaml) Développeur INRIA Dernière version stable 3.11.1 (le 12 … Wikipédia en Français
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
In-place matrix transposition — In place matrix transposition, also called in situ matrix transposition, is the problem of transposing an N imes M matrix in place in computer memory: ideally with O(1) (bounded) additional storage, or at most with additional storage much less… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… … Wikipedia
