A small and fast Discrete Fourier Transform library
-
Updated
Aug 11, 2025 - C
#
cooley-tukey
Here are 12 public repositories matching this topic...
C# implementation of Cooley–Tukey's FFT algorithm.
fast-fourier-transform fft cooley-tukey-fft data-processing time-domain frequency-domain fourier-transform fft-analysis cooley-tukey
-
Updated
Aug 10, 2023 - C#
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.
-
Updated
May 2, 2021 - C
VectorFFT is a vectorized, pure C FFT library optimized for x86 processors (AVX-512, AVX2, SSE2) with zero external dependencies. It implements mixed-radix algorithms for common sizes and Bluestein's method for arbitrary lengths, with OpenMP multi-threading for large transforms. Designed for both digital signal processing and financial applications
simd fft vectorization cooley-tukey-fft fma bluestein fourier-transform fft-library bluestein-fft prefetching fft-algorithm butterfly-operation cooley-tukey mixed-radix good-thomas rader-fft dit-fft
-
Updated
Nov 12, 2025 - C
Implementations of Algorithms to Architectures following : https://youtube.com/playlist?list=PLco7dux9L7g1RrB8TqUVCMEeu86D7azeg
dft discrete cooley-tukey-fft implementation floating-point decimation division discrete-fourier-transform cooley-tukey non-restoring restoring-division non-restoring-division binary-division single-precision signed-division unsigned-division decimation-in-time signle-precision-floating-pont
-
Updated
Jun 21, 2021 - TeX
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)
-
Updated
Dec 22, 2025 - Rust
Fast Discrete Cosine Transform (FCT) using an FFT optimzed for real input sequences
-
Updated
Mar 17, 2022 - C++
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.
-
Updated
Jun 3, 2025 - C++
use fft (fast fourier transform) as a quick way to do convolution.
-
Updated
Jul 2, 2023 - Python
Fast Fourier Transform (by using the Cooley-Tukey (butterfly) algorithm) - Algorithm designs and analysis presentation - Fall 2023 /// by theMHD & Se.MHSN.
python dft fast-fourier-transform fft cooley-tukey-fft butterfly fourier-transform discrete-fourier-transform fft-algorithm fft-analysis cooley-tukey fast-fourier-transformations
-
Updated
Dec 1, 2023 - Python
Radix-2 Cooley-Tukey algorithm implementation in Haskell
-
Updated
Jul 11, 2022 - 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.
-
Updated
Nov 15, 2024 - Python
Improve this page
Add a description, image, and links to the cooley-tukey topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the cooley-tukey topic, visit your repo's landing page and select "manage topics."