The Implementation of Fast Radix 2 Transforms on Array Processors

Authors:
C. R. Jesshope
Affiliations:
Department of Computer Science, University of Reading
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 1
Cited 1

ILLIAC IV Software and Application Programming

IEEE Transactions on Computers

Parallelization and Performance Analysis of the Cooley-Tukey FFT Algorithm for Shared-Memory Architectures

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

Methods of implementing fast radix 2 transforms on array processors are considered. The complexity of arithmetic and data routing operations is analyzed for the methods given. It is shown that all methods give an O(P) speed-up in the arithmetic operations for a P processor array. However the methods incur an overhead in data organization. Theorems are presented that prove one method to be superior in minimizing this overhead for transforms of length N P.