/Fast_Fourier_Transform_CUDA

Parallel FFT algorithm using CUDA (Cooley-Tukey algorithm)

Primary LanguageCuda

Fast_Fourier_Transform_CUDA

Parallel FFT algorithm using CUDA (Cooley-Tukey algorithm)

Compile:

nvcc -O2 fft_main.cu fft.cu -o fft

Execute:

./fft M

Note that $N=2^M$ and $M = 23$, $24$, $25$ and $26$.