Name
Abstract | ||
|---|---|---|
In this paper we present a parallelization of the Cooley- Tukey FFT algorithm that is implemented on a shared-memory MIMD (non-vector) machine that was built in the Dept. of Computer Science, Tel Aviv University. A parallel algorithm is presented for one dimension Fourier transform with performance analysis. For a large array of complex numbers to be transformed, an almost linear speed-up is demonstrated. This algorithm can be executed by any number of processors, but generally the number is much less than the length of the input data. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0167-8191(90)90031-4 | PARALLEL COMPUTING |
Keywords | DocType | Volume |
parallel algorithm | Journal | 15 |
Issue | ISSN | Citations |
1-3 | 0167-8191 | 31 |
PageRank | References | Authors |
3.32 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Averbuch | 1 | 569 | 73.41 |
| Eran Gabber | 2 | 549 | 112.28 |
| Boaz Gordissky | 3 | 31 | 3.32 |
| Yoav Medan | 4 | 31 | 3.65 |