Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:Fast_Fourier_Transform |
| gptkbp:category |
gptkb:algorithm
numerical analysis |
| gptkbp:complexity |
O(N log N)
|
| gptkbp:developedBy |
gptkb:John_Tukey
gptkb:James_Cooley |
| gptkbp:firstPublished |
1965
|
| gptkbp:input |
sequence of complex numbers
|
| gptkbp:isDivideAndConquer |
true
|
| gptkbp:isRecursive |
true
|
| gptkbp:output |
frequency spectrum
|
| gptkbp:partOf |
gptkb:Cooley-Tukey_FFT_algorithm
|
| gptkbp:relatedTo |
gptkb:decimation-in-frequency_FFT
|
| gptkbp:requiresInputLength |
power of two
|
| gptkbp:step |
bit-reversal permutation
butterfly operation |
| gptkbp:usedFor |
computing discrete Fourier transform
|
| gptkbp:usedIn |
digital signal processing
|
| gptkbp:bfsParent |
gptkb:Fast_Fourier_Transform_(FFT)_algorithms
gptkb:decimation-in-frequency_FFT |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
decimation-in-time FFT
|