Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
efficient for arbitrary-length DFTs
|
| gptkbp:alsoKnownAs |
chirp z-transform algorithm
|
| gptkbp:application |
audio processing
image processing spectral analysis signal analysis |
| gptkbp:canBe |
non-power-of-two DFTs
prime-length DFTs |
| gptkbp:citation |
Bluestein, L. I. (1968). A new fast Fourier transform algorithm. IEEE Transactions on Audio and Electroacoustics, 16(1), 4-5.
|
| gptkbp:complexity |
O(N log N)
|
| gptkbp:field |
numerical analysis
digital signal processing |
| https://www.w3.org/2000/01/rdf-schema#label |
Bluestein's FFT
|
| gptkbp:introducedIn |
1968
|
| gptkbp:inventedBy |
gptkb:Leo_Bluestein
|
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Audio_and_Electroacoustics
|
| gptkbp:purpose |
compute discrete Fourier transform
|
| gptkbp:relatedTo |
gptkb:Cooley-Tukey_FFT
gptkb:chirp_z-transform |
| gptkbp:uses |
gptkb:fast_Fourier_transform
convolution |
| gptkbp:bfsParent |
gptkb:fast_Fourier_transform_(FFT)
|
| gptkbp:bfsLayer |
5
|