Rader's algorithm (1968), named for Charles M. Rader of MIT Lincoln Laboratory, is a fast Fourier transform (FFT) algorithm that computes the discrete...
7 KB (1,095 words) - 21:35, 10 December 2024
The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses the...
10 KB (1,975 words) - 00:58, 6 April 2025
Fast Fourier transform (redirect from FFT algorithm)
Winograd also makes use of the PFA as well as an algorithm by Rader for FFTs of prime sizes. Rader's algorithm, exploiting the existence of a generator for...
67 KB (7,809 words) - 05:39, 1 July 2025
Tristan Rader, American politician William C. Rader (born 1938), American psychiatrist Rader, Missouri, a community in the United States Rader's FFT algorithm...
2 KB (329 words) - 15:03, 14 July 2025
The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete...
36 KB (5,348 words) - 13:38, 23 May 2025
Bluestein's FFT algorithm Bruun's FFT algorithm Cooley–Tukey FFT algorithm Fast Fourier transform Prime-factor FFT algorithm Rader's FFT algorithm Fast folding...
72 KB (7,951 words) - 17:13, 5 June 2025
Chirp Z-transform (redirect from Chirp-z FFT algorithm)
arbitrary sizes, including prime sizes. (The other algorithm for FFTs of prime sizes, Rader's algorithm, also works by rewriting the DFT as a convolution...
11 KB (1,570 words) - 16:02, 23 April 2025
Fastest Fourier Transform in the West (category FFT algorithms)
Cooley–Tukey FFT algorithm (corresponding to different factorizations and/or different memory-access patterns), while for prime sizes it uses either Rader's or...
6 KB (623 words) - 20:01, 27 June 2025
List of numerical analysis topics (redirect from List of eigenvalue algorithms)
Split-radix FFT algorithm — variant of Cooley–Tukey that uses a blend of radices 2 and 4 Goertzel algorithm Prime-factor FFT algorithm Rader's FFT algorithm Bit-reversal...
70 KB (8,327 words) - 09:12, 7 June 2025
Bit-reversal permutation (category FFT algorithms)
reversal is most important for radix-2 Cooley–Tukey FFT algorithms, where the recursive stages of the algorithm, operating in-place, imply a bit reversal of...
12 KB (1,557 words) - 21:21, 22 July 2025
representation Langlands program Bluestein's FFT algorithm Cooley–Tukey FFT algorithm Rader's FFT algorithm Number-theoretic transform Irrational base discrete...
3 KB (202 words) - 12:10, 30 October 2023
Convolution (section Fast convolution algorithms)
N) complexity. The most common fast convolution algorithms use fast Fourier transform (FFT) algorithms via the circular convolution theorem. Specifically...
67 KB (8,819 words) - 22:44, 19 June 2025
Discrete Hartley transform (section Fast algorithms)
permutations and/or phase rotations in those algorithms. In contrast, a standard prime-size FFT algorithm, Rader's algorithm, can be directly applied to the DHT...
23 KB (4,188 words) - 15:25, 25 February 2025
be exactly represented. For the implementation of a "fast" algorithm (similar to how FFT computes the DFT), it is often desirable that the transform...
20 KB (3,992 words) - 20:05, 19 June 2025
converting the modified spectrum back into a time-series signal with an inverse FFT operation. These filters give O(n log n) computational costs whereas conventional...
25 KB (3,692 words) - 14:34, 13 April 2025