Fully pipelined Integer Scaled / Unscaled Radix-2 Forward/Inverse Fast Fourier Transform (FFT) IP-core for newest Xilinx FPGAs (Source language - VHDL / Verilog). GNU GPL 3.0.

Floating point Forward/Inverse Fast Fourier Transform (FFT) IP-core for newest Xilinx FPGAs (Source lang. - VHDL).

C# implementation of Cooley–Tukey's FFT algorithm.

C++20实现快速傅立叶变换 C++20 implements fast Fourier transform

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.

Implement Fast Fourier Transform with c and python

Implementations of Algorithms to Architectures following : https://youtube.com/playlist?list=PLco7dux9L7g1RrB8TqUVCMEeu86D7azeg

Radix-2 Out-of-Place DIT FFT Algorithm for 1D Real Input

Contains Serial (recursive) and Parallel Version (openMPI and CUDA) of the Fast Fourier Transform algorithm.

Discrete and Fast Fourier Transformations

OpenCL Fast Fourier Transform using cooley-tukey in-place bit-reversal algorithm with lookup tables.

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.

View and edit audio files in frequency-domain, to filter out audio by frequency.

Optimizing 2D FFT as the High Performance Computing Project @brown

Radix-2 Cooley-Tukey algorithm implementation in Haskell

Projects from SF2568

Fast Fourier Transform (by using the Cooley-Tukey (butterfly) algorithm) - Algorithm designs and analysis presentation - Fall 2023 /// by theMHD & Se.MHSN

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.

GPU-accelerated Fast Fourier Transform implementation using CUDA. Demonstrates Cooley-Tukey radix-2 algorithm with shared memory optimization, achieving 534x speedup over CPU and 1.74x over NumPy for large transforms. Developed on Tesla P100.

VHDL modular Fast Fourier Transform based on Cooley-Tukey algorithm