Fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors. As a result, it manages to reduce the complexity of computing the DFT from , which arises if one simply applies the definition of DFT, to , where is the data size. The difference
Wikipage disambiguates
Applications of the fast Fourier transformApproximations of the fast Fourier transformArithmetic complexity of the discrete Fourier transformArithmetic complexity of the discrete fourier transformFFTFFT algorithmFFT complexityFast FourierFast Fourier TransformFast Fourier TransformsFast fourierFast fourier transformIFFTInteraction algorithm
Wikipage redirect
1903 in science1965 in science20th century in science3SUM4GALGLIBAMD Core Math LibraryAN/AQS-13AVT Statistical filtering algorithmAbe JacobAcoustic cryptanalysisAcoustic resonance spectroscopyAdditive synthesisAdobe AuditionAdvanced Audio CodingAlberto dos Santos FrancoAlexanderson DayAlgorithmAlgorithmic efficiencyAmbiguity functionAmbiguity resolutionAngular spectrum methodAnton (computer)ApodizationApplications of the fast Fourier transformApproximations of the fast Fourier transformArbitrary-precision arithmeticArithmetic complexity of the discrete Fourier transformArithmetic complexity of the discrete fourier transformAsynchronous array of simple processorsAtari AMYAudacious (software)Audio analysisAudio analyzerAutocorrelationBEAST (music composition)BRP-PACUBasic affine jump diffusionBaudlineBayesian operational modal analysis
Link from a Wikipage to another Wikipage
primaryTopic
Fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors. As a result, it manages to reduce the complexity of computing the DFT from , which arises if one simply applies the definition of DFT, to , where is the data size. The difference
has abstract
A Transformada rápida de Fouri ...... ting in Science & Engineering.
@pt
A fast Fourier transform (FFT) ...... can easily be adapted for it.
@en
Die schnelle Fourier-Transform ...... n gegeben, so etwa von , und .
@de
En snabb fouriertransform, på ...... DIT är det vanligaste fallet.
@sv
In de numerieke wiskunde is ee ...... ntijd dan strikt noodzakelijk.
@nl
In matematica, la trasformata ...... al basso costo computazionale.
@it
La transformada ràpida de Four ...... e problemes aritmètics comuns.
@ca
La transformada rápida de Four ...... la historia de la informática.
@es
La transformation de Fourier r ...... au format d'image JPEG (1991).
@fr
Rychlá Fourierova transformace ...... t i pro počítání inverzní DFT.
@cs
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,834,500
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
A Transformada rápida de Fouri ...... , onde é o tamanho dos dados.
@pt
A fast Fourier transform (FFT) ...... the data size. The difference
@en
Die schnelle Fourier-Transform ...... n Koeffizienten zur Anwendung.
@de
En snabb fouriertransform, på ...... DIT är det vanligaste fallet.
@sv
In de numerieke wiskunde is ee ...... anzienlijk, zeker voor grote .
@nl
In matematica, la trasformata ...... al basso costo computazionale.
@it
La transformada ràpida de Four ...... ransformada ràpida de Fourier.
@ca
La transformada rápida de Four ...... transformación de 512, 1024, 2
@es
La transformation de Fourier r ...... rmule de définition de la TFD.
@fr
Rychlá Fourierova transformace ...... sla. DFT je definována vzorcem
@cs
label
Fast Fourier transform
@en
Fast Fourier transform
@nl
Rychlá Fourierova transformace
@cs
Schnelle Fourier-Transformation
@de
Snabb fouriertransform
@sv
Szybka transformacja Fouriera
@pl
Transformada ràpida de Fourier
@ca
Transformada rápida de Fourier
@es
Transformada rápida de Fourier
@pt
Transformasi Fourier cepat
@in