Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:Fast_Fourier_Transform |
| gptkbp:advantage |
efficient for prime-length DFTs
|
| gptkbp:alsoKnownAs |
chirp z-transform algorithm
|
| gptkbp:complexity |
O(N log N)
|
| gptkbp:computes |
gptkb:discrete_Fourier_transform
|
| gptkbp:field |
numerical analysis
digital signal processing |
| gptkbp:hasWorkedWith |
arbitrary length input
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bluestein's FFT algorithm
|
| gptkbp:input |
complex sequence
|
| gptkbp:namedAfter |
gptkb:Leo_Bluestein
|
| gptkbp:output |
DFT of input sequence
|
| gptkbp:publicationYear |
1968
|
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Audio_and_Electroacoustics
|
| gptkbp:relatedTo |
gptkb:Cooley–Tukey_FFT_algorithm
gptkb:Rader's_FFT_algorithm |
| gptkbp:uses |
convolution
chirp multiplication |
| gptkbp:bfsParent |
gptkb:Rader's_FFT
|
| gptkbp:bfsLayer |
6
|