%0 Journal Article
%T Parallel fast Fourier transform algorithm based on binary fat tree network<br>一种基于二叉胖树模型的并行FFT算法
%A WEI Wen-hong
%A GAO Da-li
%A <br>魏文红
%A 高大利
%J 计算机应用
%D 2007
%I 
%X The binary fat tree is a network topology which is prone to accomplish butterfly computing. According to this feature, a logical model for binary fat tree was constructed at first, and then a parallel Fast Fourier Transform algorithm based on it was developed. In this algorithm, balance of load was achieved in the process, and time complexity was reduced compared with serial algorithm. At last the algorithm was implemented in cluster and MPI, and experimental data was analyzed.
%K binary fat tree
%K butterfly computing
%K Fast Fourier Transform (FFT)
%K parallel computing<br>二叉胖树
%K 蝶式计算
%K 快速傅立叶变换
%K 并行计算
%K 树模型
%K 并行
%K 串行算法
%K network
%K tree
%K binary
%K based
%K algorithm
%K fast
%K Fourier
%K transform
%K 数据分析
%K 实验
%K 环境
%K 集群系统
%K 复杂度
%K 时间
%K 负载平衡
%K 进程间
%K 快速傅立叶变换算法
%K 逻辑模型
%K 构造
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD2743051282C8FDA913936CAB&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=E158A972A605785F&sid=FC6FCA5A7559F1FB&eid=97747634025A5F36&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=6