与FFT并行算法相适应的体系结构探讨  

Discussion About Architectures Associated with Parallel FFT Algorithm

作　　者：孙世新[1] 陈平安[1] 张艳[1] 

机构地区：[1]电子科技大学计算机学院,成都610054

出　　处：《电子科技大学学报》2000年第5期535-539,共5页Journal of University of Electronic Science and Technology of China

基　　金：电子部"九五"预研项目

摘　　要：介绍了并行ＦＦＴ算法，讨论其在网格和超立方体并行体系结构上的实现方法，并作了多个方面的比较，为高效实现并行ＦＦＴ选择一种合适的体系结构。经研究表明，并行ＦＦＴ算法的最佳体系结构为超立方体。This paper mainly discusses the parallel FFT on mesh and hyper-cube which is widely used in parallel computing at present. The hardware distinction, the communication overhead, the system efficiency and the scalability of parallel FFT on those two architectures are studied respectively provd that hyper-cube is much better than mesh for parallel FFT. The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.

关 键 词：快速傅里叶变换 并行算法 体系结构 

分 类 号：O174.22[理学—数学] TP301.6[理学—基础数学]