Issue No. 01 - January (1980 vol. 29)
C.R. Jesshope , Department of Computer Science, University of Reading
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.
parallel computation, Array processors, complexity, fast Fourier transform
C. Jesshope, "The Implementation of Fast Radix 2 Transforms on Array Processors," in IEEE Transactions on Computers, vol. 29, no. , pp. 20-27, 1980.