A FAST FOURIER TRANSFORM ALGORITHM FOR A GLOBAL, HIGHLY PARALLEL PROCESSOR

被引：10

作者：

BERGLAND, GD

WILSON, DE

机构：

[1] Bell Telephone Laboratories, Inc., Whippany

来源：

IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS | 1969年 / AU17卷 / 02期

关键词：

D O I：

10.1109/TAU.1969.1162039

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

A fast Fourier transform (FFT) algorithm is presented for an unstructured, parallel ensemble of computing elements with global control. The procedure makes efficient use of a fixed-size memory and minimizes data transmission between computing elements. Included are some practical considerations of the trade-offs between element utilization and gain of computing speed via parallelism. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：125 / &