Cooley-Tukey FFT on the Connection Machine (Q1195705): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Manfred Tasche / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Manfred Tasche / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cooley-Tukey FFT on the Connection Machine |
scientific article |
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
