Cooley-Tukey FFT on the Connection Machine
type: Item
instance of: scholarly article
title: Cooley-Tukey FFT on the Connection Machine
zbMATH Open document ID: 0762.65105
DOI: 10.1016/0167-8191(92)90066-G
author: S. Lennart Johnsson
author: Robert L. Krawitz
published in: Parallel Computing
publication date: 1993-01-19T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65Y10
zbMATH DE Number: 85911
zbMATH Keywords: implementation features
zbMATH Keywords: performance data
zbMATH Keywords: Cooley-Tukey fast Fourier transform
zbMATH Keywords: connection machine
reviewed by: Manfred Tasche
MaRDI profile type: Publication
full work available at URL: 0167-8191(92)90066-g
OpenAlex ID: W2078492923
description: scientific article; zbMATH DE number 85911