Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
divide and conquer algorithm
|
| gptkbp:complexity |
O(N log N)
|
| gptkbp:developedBy |
efficient computation of DFT
|
| https://www.w3.org/2000/01/rdf-schema#label |
Radix-2 algorithm
|
| gptkbp:operates |
sequences of length power of 2
|
| gptkbp:relatedTo |
gptkb:Cooley-Tukey_algorithm
|
| gptkbp:requires |
input length to be a power of 2
|
| gptkbp:usedIn |
gptkb:Fast_Fourier_Transform
image processing digital signal processing |
| gptkbp:bfsParent |
gptkb:Fast_Fourier_Transform_(FFT)
|
| gptkbp:bfsLayer |
5
|