Some New Parallel Fast Fourier Transform Algorithms

Authors:
Zhong Cui-xiang;Han Guo-qiang;Huang Ming-he
Affiliations:
South China University of Technology Jiangxi Normal University Guangzhou;South China University of Technology Jiangxi Normal University Guangzhou;Jiangxi Normal University, China
Venue:
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Year:
2005

Citing 0
Cited 3

Low-cost client puzzles based on modular exponentiation

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Fast transform-based preconditioners for large-scale power grid analysis on massively parallel architectures

Proceedings of the International Conference on Computer-Aided Design
A parallel fast transform-based preconditioning approach for electrical-thermal co-simulation of power delivery networks

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discrete Fourier transform (DFT) has many applications in digital signal and image processing and other scientific and technological domains, but its time complexity of direct computation is O(n2), limiting greatly its application range. Thus many people have developed fast Fourier transform (FFT) algorithms, reducing the complexity from O(n2) to O(nlogn)(In this paper logn denotes log2n).But for large n, O(nlogn) is still very high. So multiprocessor systems have been used to speed up the computation of DFT. This paper first introduces a new general method to deduce FFT algorithms, then transforms the deduced second radix-2 decimation-in-time FFT algorithm into another parallelizable sequential form, and finally transforms the latter algorithm into a new parallel FFT algorithm, reducing the time complexity of DFT to O(nlogn/p) (where p is the number of processors). Using similar methods, the authors can also design other new parallel 1-D and 2-D FFT algorithms.