Cooley–Tukey FFT algorithm (1965)
GPTKB entity
Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:Fast_Fourier_Transform |
| gptkbp:alsoKnownAs |
gptkb:Cooley–Tukey_algorithm
|
| gptkbp:application |
communications
data compression image processing audio signal processing spectral analysis |
| gptkbp:complexity |
O(N log N)
|
| gptkbp:field |
numerical analysis
digital signal processing |
| gptkbp:generalizes |
gptkb:Fourier_transform
|
| gptkbp:hasSpecialCase |
gptkb:fast_Fourier_transform
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cooley–Tukey FFT algorithm (1965)
|
| gptkbp:influenced |
modern digital signal processing
|
| gptkbp:input |
sequence of complex numbers
|
| gptkbp:inventedBy |
gptkb:John_Tukey
gptkb:James_Cooley |
| gptkbp:method |
divide and conquer
|
| gptkbp:output |
gptkb:discrete_Fourier_transform
|
| gptkbp:publicationYear |
1965
|
| gptkbp:publishedIn |
gptkb:Mathematics_of_Computation
|
| gptkbp:purpose |
efficient computation of discrete Fourier transform
|
| gptkbp:relatedTo |
mixed-radix FFT
radix-2 FFT radix-4 FFT |
| gptkbp:bfsParent |
gptkb:C._Hadlai_"Tex"_Hull
|
| gptkbp:bfsLayer |
7
|