摘要
基于 L S MPP的 K元 2 -立方体网络结构 ,设计了一种新颖快速的计算 FFT的 SIMD算法 .系统地分析了时间提取的基 - 2一维 FFT算法及其原理 ,较详细地讨论了用二维 FFT算法并行计算二维 DFT的问题 :主要从算法原理出发 ,分析并给出了在 L S MPP SIMD计算机上用二维 FFT并行计算二维 DFT时各变换步的变换矩阵及其格式 ,设计了自动建立各变换步的变换矩阵的算法 .
Based on K ary 2 cube network architecture of LS MPP, a novel and fast SIMD algorithm for computing FFT was designed. Firstly, we systemically analyze one dimension FFT algorithm which was time pick up and is based on 2. Secondly, a problem of parallel computing two dimension DFT was discussed by using two dimension FFT in detail. In this paper, according to the principles of the two dimension FFT, every transform steps transform array, which was used to compute two dimension DFT by using two dimension FFT on the LS MPP SIMD computer, was presented. An algorithm of building automatically transform array of every transform step was designed.
出处
《小型微型计算机系统》
CSCD
北大核心
2004年第7期1303-1306,共4页
Journal of Chinese Computer Systems
基金
国家"九五"预研课题 (4 5 .7.1)资助