FFT methods: Rader and Bluestein. Implemented in Python.
-
Updated
Dec 30, 2021 - Python
#
bluestein
Here are 6 public repositories matching this topic...
Fast Fourier transform (FFT) using the Cooley–Tukey algorithm for power-of-two sizes and Bluestein's algorithm for non-power-of-two sizes.
-
Updated
Dec 19, 2022 - Java
Permutation-free mixed-radix FFT library in C with hand-tuned AVX2/AVX-512 codelets for 18 radixes, zero-allocation in-place execution, and a calibrated wisdom planner. Beats Intel MKL on 207/207 cells (median 2.36×) and FFTW3 on 202/207 (median 3.21×). Pure C, no runtime dependencies.
simd fft vectorization cooley-tukey-fft bluestein fourier-transform fft-library bluestein-fft butterfly-operation cooley-tukey mixed-radix rader-fft dit-fft dag-optimization
-
Updated
May 17, 2026 - C
CUDA sparse binary 2-D FFT with compact CSC input, Bluestein transforms, and cuFFT/SpFFT baselines.
cuda high-performance-computing fft gpu-computing sparse-matrix bluestein cufft matrix-market stockham-fft spfft
-
Updated
May 24, 2026 - Cuda
A comparison study between different FFT algorithms implemented in Java as part of the bachelor's degree. Implemented algorithms: Furier transform by definition, radix-2 (DIT) recursive, radix-2 (DIT) iterative, radix-2 (DIF) recursive, radix-4 (DIT) recursive, radix-4 (DIF) recursive, radix-4 (DIT) iterative, split radix (DIT), split radix (DIF…
-
Updated
Mar 11, 2017 - EmberScript
Improve this page
Add a description, image, and links to the bluestein topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bluestein topic, visit your repo's landing page and select "manage topics."