Skip to Main Content
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.
Date of Conference: 14-16 Aug. 2010