An Experiment in Parallelizing the Fast Fourier Transform
The University of Akron
The 2011 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’11), 2011
We present the parallel implementation of two new algorithms developed for the discrete cosine transform. These algorithms support the new interleaved fast Fourier transform method. Our techniques were realized using the MPI standard library and executed on a variety of equipment for comparison. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.
December 24, 2011 by hgpu