DocumentCode
1140759
Title
The Implementation of Fast Radix 2 Transforms on Array Processors
Author
Jesshope, C.R.
Author_Institution
Department of Computer Science, University of Reading
Issue
1
fYear
1980
Firstpage
20
Lastpage
27
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.
Keywords
Array processors; complexity; fast Fourier transform; parallel computation; Arithmetic; Concurrent computing; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Multidimensional systems; Parallel processing; Routing; Switches; Array processors; complexity; fast Fourier transform; parallel computation;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1980.1675452
Filename
1675452
Link To Document