By Topic

An Improved Parallel FFT Algorithm and Application in Grid Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming Chen ; Dept. of Comput. Sci. & Technol., China Univ. of Pet., Beijing, China ; Yong Li ; Jian Yue Zhang

With the extensive applications of FFT in digital signal processing and image signal processing which needs a extensive application of large-scale computing, it Become more and more important to improve parallelism, Efficient and Scalable parallel of FFT algorithm. This paper Improve the parallelism of the FFT algorithm based on the Six-Step FFT algorithm, And build up a framework Based on Grid, Through the calculation of the matrix assigned to the various nodes of grid computing and the use of hiding the transpose matrix mapping optimization strategy etc, it makes the parallel FFT algorithm high efficiency. In the end, the paper evaluates the performance of the improved FFT parallel algorithm.

Published in:

Granular Computing (GrC), 2010 IEEE International Conference on

Date of Conference:

14-16 Aug. 2010