Cooley-Tukey FFT on the Connection Machine (Q1195705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cooley-Tukey FFT on the Connection Machine |
scientific article; zbMATH DE number 85911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cooley-Tukey FFT on the Connection Machine |
scientific article; zbMATH DE number 85911 |
Statements
Cooley-Tukey FFT on the Connection Machine (English)
0 references
19 January 1993
0 references
The objective of this paper is an efficient adaptation of the Cooley- Tukey fast Fourier transform (FFT) to multiprocessors interconnected by a Boolean cube network. The implementation is designed to make effective use of the communications bandwidth, the memory bandwidth, and the storage requirements with precomputed twiddle factors. The algorithms have been implemented on the connection machine systems CM-200 with 2048 floating-point processors. Performance data are provided for one- and two-dimensional FFT.
0 references
implementation features
0 references
performance data
0 references
Cooley-Tukey fast Fourier transform
0 references
connection machine
0 references
0.8815751671791077
0 references
0.8516859412193298
0 references
0.8502534627914429
0 references
0.8421938419342041
0 references
0.8386362195014954
0 references
