会议专题

Parallel Computing for the Radix-2 Fast Fourier Transform

  The fast Fourier transform (FFT) is a speed-up technique for calculating the discrete Fourier transform (DFT),which in turn is a discrete version of the continuous Fourier transform.The Fast Fourier Transform is used in linear systems analysis,antenna studies,optics,random process modeling,probability theory,quantum physics,and boundary-value problems,and has been very successfully applied to restoration of astronomical data.This paper formulates the one dimensional and two dimensional continuous and discrete Fourier transform,especially the fast Fourier transform,considers their parallel algorithms and reports the speed up of parallel computing in both shared memory and distributed memory modes.

Discrete Fourier Transform Fast Fourier Transform parallel computing Message Passing Interface OpenMP

Gang Xie Yang-chun Li

Institute of computer applications China Academy of Engineering Physics MianYang,China

国际会议

The 13th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2014)(第十三届分布式计算及其应用国际学术研讨会)

湖北咸宁

英文

133-137

2014-11-24(万方平台首次上网日期,不代表论文的发表时间)