Search results
There is a page named "Bruun's FFT algorithm" on Wikipedia
- Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of...12 KB (2,104 words) - 19:47, 3 January 2024
Fast Fourier transform (redirect from FFT algorithm)A Fast Fourier Transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis...63 KB (7,362 words) - 06:04, 12 July 2024- 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...71 KB (7,800 words) - 14:52, 28 June 2024
- List of numerical analysis topics (redirect from List of eigenvalue algorithms)transform (FFT) — a fast method for computing the discrete Fourier transform Bluestein's FFT algorithm Bruun's FFT algorithm Cooley–Tukey FFT algorithm Split-radix...70 KB (8,336 words) - 05:14, 24 June 2024
- 1978 – LZ78 algorithm developed from LZ77 by Abraham Lempel and Jacob Ziv 1978 – Bruun's algorithm proposed for powers of two by Georg Bruun 1979 – Khachiyan's...20 KB (2,097 words) - 05:37, 6 July 2024
- Discrete Hartley transform (section Fast algorithms)Winograd (1985) to Bruun's (1993), has a direct analogue for the discrete Hartley transform. (However, a few of the more exotic FFT algorithms, such as the...23 KB (4,180 words) - 01:41, 5 February 2023
