Parallel FFT Based Fast Algorithms for Solving Large Scale Electromagnetic Problems

Author(s):  
Ming Zhang ◽  
Tat Soon Yeo ◽  
Le Wei Li ◽  
Yeow Beng Gan
Author(s):  
Wei-Bing Lu ◽  
Tie Jun Cui ◽  
Zhi-Guo Qian ◽  
Xiao Xing Yin ◽  
Wei Hong

Author(s):  
Liefeng Bo ◽  
Cristian Sminchisescu ◽  
Atul Kanaujia ◽  
Dimitris Metaxas
Keyword(s):  

2013 ◽  
Vol 647 ◽  
pp. 880-884
Author(s):  
Yong Li

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.


Sign in / Sign up

Export Citation Format

Share Document