大规模集群上多维FFT算法的实现与优化研究-计算机科学与探索.PDF

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2017/ 11(06)-0863-12 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1611079 大规模集群上多维FFT 算法的实现与优化研究* 1,2+ 1 1 1 李 琨 ，贾海鹏 ，曹 婷 ，张云泉 1. 中国科学院 计算技术研究所 计算机体系结构国家重点实验室，北京 100190 2. 中国科学院大学 计算机与控制学院，北京 100190 Implementation and Optimization of Multidimensional FFT Algorithm on Large- Scale Clusters 1,2+ 1 1 1 LI Kun , JIA Haipeng , CAO Ting , ZHANG Yunquan 1. State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China 2. School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100190, China + Corresponding author: E-mail: likun@ LI Kun, JIA Haipeng, CAO Ting, et al. Implementation and optimization of multidimensional FFT algorithm on large-scale clusters. Journal of Frontiers of Computer Science and Technology, 2017, 11(6) ：863-874. Abstract: Fast Fourier transform (FFT) is a fast algorithm which computes the discrete Fourier transform (DFT) of a sequence, or its inverse. Fast Fourier transform is widely used for many applications in engineering, science and mathematics, such as signal decomposition, digital filter and image processing. As a result, the fine-grained optimi- zation of FFT is extremely important in application. This paper studies the typical decomposition strategies of FFT, the parallel implementation of FFT algorithms on large-scale clusters and proposes some optimizatio