A small and fast Discrete Fourier Transform library
-
Updated
Aug 11, 2025 - C
A small and fast Discrete Fourier Transform library
C# implementation of Cooley–Tukey's FFT algorithm.
A FFT library in C, emitted by a Ocaml DAG FFT compiler. Supports both interleaved and split layouts, In-place & out-of-place C2C/R2C/C2R, 2D, and DCT/DST/DHT, with a calibrated wisdom planner. Beats Intel MKL on C2C and on multithreaded real/2D transforms. Pure C, zero dependencies.
Fast-Fourier Transform in 2D. Examination of Cooley-Tukey Algorithm for 2D FFT, image I/O for FFT, and a shared memory implementation of FFT on the GPU.
Implementations of Algorithms to Architectures following : https://youtube.com/playlist?list=PLco7dux9L7g1RrB8TqUVCMEeu86D7azeg
The Cooley-Tukey algorithm is the Most Common Form of The Fast Fourier Transform (FFT). It Revolutionised Digital Signal Processing by Drastically Reducing the Time it Takes to Compute a Discrete Fourier Transform (DFT)
Fast Discrete Cosine Transform (FCT) using an FFT optimzed for real input sequences
University project of the Advanced Methods for Scientific Computing course. Implementation of the Cooley-Tukey algorithm (parallel and sequential) for computing the Fast Fourier Transform (FFT) and its inverse.
Radar DSP SIMULATION :: I/Q generation → Windowing → FFT/PSD → CA-CFAR → TMR majority vote → Doppler/velocity estimation → Tracker (SEARCH/LOCKED) → Kalman filter → Watchdog | SIM - Not Real hardware.
Fast Fourier Transform (by using the Cooley-Tukey (butterfly) algorithm) - Algorithm designs and analysis presentation - Fall 2023 /// by theMHD & Se.MHSN
Audio signal analyzer and steganography tool using Discrete Fourier Transform.
use fft (fast fourier transform) as a quick way to do convolution.
Radix-2 Cooley-Tukey algorithm implementation in Haskell
The original FFT implementation by Cooley-Tukey as written in the 1965 paper "An Algorithm for the Machine Calculation of Complex Fourier Series" written in Python.
Radix-2 Cooley-Tukey FFT kernel in CUDA/C with shared-memory stage fusion and a coalesced bit-reversal transpose. Reaches 25% of cuFFT throughput and 70x over a single-threaded CPU on 1M-point transforms (NVIDIA T4). Every figure reproducible from the included Colab notebook.
Add a description, image, and links to the cooley-tukey topic page so that developers can more easily learn about it.
To associate your repository with the cooley-tukey topic, visit your repo's landing page and select "manage topics."