PARALLEL FFT ALGORITHMS FOR MIMD COMPUTERS

被引：0

作者：

FUNG, MK

NANDI, AK

机构：

[1] Electrical Engineering Department, Imperial College of Science Technology and Medicine

来源：

ELECTRONICS LETTERS | 1991年 / 27卷 / 03期

关键词：

ALGORITHMS; FAST FOURIER TRANSFORMS;

D O I：

10.1049/el:19910181

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Two methods of computing the FFT (fast Fourier transform) concurrently by multiple computers are presented. Both methods have been implemented on a set of transputers. The first method runs on a simple cyclic network, whereas the second one requires a hypercube configuration. Based on simulations and analysis, their relative advantages and disadvantages in terms of speed-up performance, memory requirement, and host participation are discussed.

引用

页码：286 / 288

页数：3

共 7 条

[1] GRAY CODES, FAST FOURIER-TRANSFORMS AND HYPERCUBES [J].