fast fourier transform
1Fast 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 …
2Fast Fourier Transform — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… …
3fast Fourier transform — sparčioji Fourier transformacija statusas T sritis automatika atitikmenys: angl. fast Fourier transform vok. schnelle Fouriertransformation, f rus. быстрое преобразование Фурье, n pranc. transformation de Fourier rapide, f ryšiai: sinonimas –… …
4Fast Fourier Transform Telescope — is Max Tegmark s name for an all digital synthetic aperture telescope.In 1868, Hippolyte Fizeau realized that the lenses and mirrors in a telescope perform a physical approximation of a Fourier transform.Fact|date=October 2008 He noted that by… …
5fast Fourier transform — noun a) A member of a certain family of algorithms for efficiently computing the discrete Fourier transform of data. b) An instance of performing one of these algorithms …
6Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …
7Fourier transform on finite groups — In mathematics, the Fourier transform on finite groups is a generalization of the discrete Fourier transform from cyclic to arbitrary finite groups.DefinitionsThe Fourier transform of a function f : G ightarrow mathbb{C},at a representation ho,… …
8Fast-Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… …
9Fast Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… …
10Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …
