This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Implementation of Fast Radix 2 Transforms on Array Processors
January 1980 (vol. 29 no. 1)
pp. 20-27
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.
Index Terms:
parallel computation, Array processors, complexity, fast Fourier transform
Citation:
C.R. Jesshope, "The Implementation of Fast Radix 2 Transforms on Array Processors," IEEE Transactions on Computers, vol. 29, no. 1, pp. 20-27, Jan. 1980, doi:10.1109/TC.1980.1675452
Usage of this product signifies your acceptance of the Terms of Use.