By Topic

A Parallel FFT Scheme Based on Multi-Machines 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)
Bo Chen ; Huazhong Univ. of Sci. & Technol., Wuhan ; Chunqiang Zeng ; Yingxian Jiang

As a basic operation of signal processing, discrete Fourier transform (DFT) has a strict demand with executing speed. However, the current widely used fast Fourier transform (FFT) which can greatly accelerate DFT can't still adapt to the required speed when the data amount is tremendous. There is an awareness of that parallel schemes can be an efficient way to accelerate the FFT computing. In this paper, a parallel FFT course and its scheduling scheme in multi-machines environmentwere introduced. How to do further optimization on this scheme for the optimal accelerating rate was discussed, and some basic principles were pointed out.

Published in:

Grid and Pervasive Computing Workshops, 2008. GPC Workshops '08. The 3rd International Conference on

Date of Conference:

25-28 May 2008