An Improved Parallel FFT Algorithm Based on the GPU

Yong Li

doi:10.4028/www.scientific.net/AMR.647.880

Paper Titles

Effective Falls Detection Method Using Two Tri-Axial Accelerometers
p.854

Design and Realization of Universal Operation Simulation Platform for Large Communication Equipment
p.861

The Model of Transfer Robot in Chemical Mechanical Polishing
p.867

Numerical Solution of Parabolic Equation on a 2-D Infinite Strip with Composite Hermite-Legendre Spectral Method
p.875

An Improved Parallel FFT Algorithm Based on the GPU
p.880

Design of Steering Trapezoidal Mechanism for FSC Racing Base on Matlab
p.885

The Parallel Research of MP Sparse Decomposition in Grid Environment
p.891

A SIFT Feature Matching Algorithm Based on Semi-Variance Function
p.896

Design of a Automatic Cutting Device for Intersecting Curve of Steel Pipes
p.901

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 647An Improved Parallel FFT Algorithm Based on the...

An Improved Parallel FFT Algorithm Based on the GPU

Abstract:

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, especially efficient and scalable parallel of FFT algorithm. This paper improves the parallelism of the FFT algorithm based on the Six-Step FFT algorithm. The introduction of GPU to parallel computing is to realize parallel FFT computing in a single machine and to improve the speed of Frontier transform. With the optimization strategy of the mapping hiding the transport matrix, the performance of parallel FFT algorithm after optimization is remarkably promoted by the assignment of matrix calculation and butterfly computation to GPU. Finally it applies to design the digital filter in seismic data.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 647)

Pages:

880-884

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.647.880

Citation:

Cite this paper

Online since:

January 2013

Authors:

Yong Li

Keywords:

Graphic Processing Unit (GPU), Hiding Transpose, Parallel FFT

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Ming C, Yong L, Jian Y Z, An improved parallel FFT algorithm and application in Grid Environment. Granular Computing, 2010, 1(1): 111-114.

Google Scholar

[2] Tarditi D, Puri S, Oglesby J, Accelerator: using data parallelism to program GPUs for general-purpose uses, Proceedings of the 12th international conference on Architectural support for programming languages and operating systems[C]. san Jose, California, 2006: 21-25.

DOI: 10.1145/1168857.1168898

Google Scholar

[3] Chang S, Zhongliang F, Yuchen T, A fast calculation app roach for large scale matrix operation on GPU. Computer application, 2009, 29(4): 1177-1179(1192).

Google Scholar

[4] Enhua W. The graphics processor for general purpose computing technology, current status and challenges. Journal of software, 2004, 15(10): 1493-1504.

Google Scholar

[5] Yue Q. the graphics processor CUDA programming model applied research. Computer & Digital Engineering, 2008, 36(12): 177-180.

Google Scholar