Rader's algorithm for fast Fourier transform
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:discrete_Fourier_transform
prime-length DFT |
| gptkbp:complexity |
O(n log n)
|
| gptkbp:field |
gptkb:mathematics
computer science digital signal processing |
| https://www.w3.org/2000/01/rdf-schema#label |
Rader's algorithm for fast Fourier transform
|
| gptkbp:introducedIn |
1968
|
| gptkbp:inventedBy |
gptkb:Charles_M._Rader
|
| gptkbp:method |
converts DFT to cyclic convolution
|
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Audio_and_Electroacoustics
|
| gptkbp:purpose |
efficient computation of DFT for prime sizes
|
| gptkbp:relatedTo |
gptkb:Cooley–Tukey_FFT_algorithm
gptkb:Bluestein's_algorithm |
| gptkbp:usedIn |
image processing
signal analysis |
| gptkbp:bfsParent |
gptkb:Charles_M._Rader
|
| gptkbp:bfsLayer |
7
|