Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alternativeName |
gptkb:Rader's_algorithm
|
| gptkbp:appliesTo |
prime-length sequences
|
| gptkbp:complexity |
O(n log n)
|
| gptkbp:field |
numerical analysis
digital signal processing |
| gptkbp:input |
complex numbers
|
| gptkbp:inventedBy |
gptkb:Charles_M._Rader
|
| gptkbp:notableFor |
handling DFTs of prime length efficiently
|
| gptkbp:output |
complex numbers
|
| gptkbp:publicationYear |
1968
|
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Audio_and_Electroacoustics
|
| gptkbp:relatedTo |
gptkb:Bluestein's_FFT_algorithm
gptkb:Cooley-Tukey_FFT_algorithm |
| gptkbp:usedFor |
computing discrete Fourier transform
|
| gptkbp:bfsParent |
gptkb:fast_Fourier_transform_(FFT)
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Rader's FFT
|