Some thoughts on how to parallelize the general Cooley–Tukey FFT algorithm, mainly to benchmark the performance of different libraries like OpenMP, Intel TBB, OpenCL and C++11 threads. From Wikipedia: "The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of N1 smaller DFTs of sizes N2, recursively, to reduce the computation time to O(N log N) for highly composite N (smooth numbers)."
-
Notifications
You must be signed in to change notification settings - Fork 0
betaupsx86/FFT
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Some thoughts on how to parallelize the general Cooley–Tukey FFT algorithm, mainly to benchmark the performance of different libraries like OpenMP, Intel TBB, OpenCL and C++11 threads.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published