A parallel FFT algorithm for transputer networks

Authors:
Yonggen Huang;Yakup Paker
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1991

Citing 5
Cited 0

Two and three dimensional FFTS on highly parallel computers

Parallel Computing
Transputer reference manual

Transputer reference manual
Transputer development system

Transputer development system
Multimicroprocessor Systems

Multimicroprocessor Systems
FFT algorithms for vector computers

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a parallel FFT algorithm suitable for MIMD machines. It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices. The algorithm has been implemented for a tree and cubic types of transputer network in Occam language. A set of performance figures has been derived for different size of networks and initial matrices.