By Topic

Algorithms for long fast Fourier transforms on a Connection Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Norris, J.P. ; Naval Res. Lab., Washington, DC, USA ; Hertz, P. ; Wood, K.S. ; Anderson, P.

Several fast algorithms are developed for very long one- and two-dimensional fast Fourier transforms (FFTs) on the Connection Machine CM-2. These codes maximally exploit the parallelism afforded by single-instruction multiple-data (SIMD) machines like the CM-2. Explicit advantage is taken of the CM-2 hardware (32-b FPA, 8-kb memory per processor, programmable hypercube connectivity) and software (Paris machine level language) to simulate the butterfly connectivity required for the FFT computation. A central processor unit (CPU) benchmark of 4.6 s for a complex 221-point FFT is established, and an execution time of about 9.5 s is predicted for 222-point FFTs on a 16 K-processor CM-2. Longer FFTs, with lengths of at least 224 points, are possible on a full 64 K processor CM with no increase in CPU time. Also described are algorithms for use on Connection Machines for achieving coherence recovery of frequency-broadened signals

Published in:

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Date of Conference:

10-12 Oct 1988