Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


Computing the fast Fourier transform on a vector computer

Authors: David G. Korn and Jules J. Lambiotte
Journal: Math. Comp. 33 (1979), 977-992
MSC: Primary 65T05; Secondary 68C25
MathSciNet review: 528051
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Two algorithms are presented for performing a Fast Fourier Transform on a vector computer and are compared on the Control Data Corporation STAR-100. The relative merits of the two algorithms are shown to depend upon whether only a few or many independent transforms are desired.

A theorem is proved which shows that a set of independent transforms can be computed by performing a partial transformation on a single vector. The results of this theorem also apply to nonvector machines and have reduced the average time per transform by a factor of two on the CDC 6600 computer.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65T05, 68C25

Retrieve articles in all journals with MSC: 65T05, 68C25

Additional Information

PII: S 0025-5718(1979)0528051-4
Keywords: Fast Fourier Transform, parallel computation
Article copyright: © Copyright 1979 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia