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)


A vector implementation of the Fast Fourier Transform algorithm

Author: Bengt Fornberg
Journal: Math. Comp. 36 (1981), 189-191
MSC: Primary 68A10; Secondary 42A68
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A recent article in this journal by D. G. Korn and J. J. Lambiotte, Jr. discusses implementations of the FFT algorithm on the CDC STAR-100 vector computer. The 'Pease'-algorithm is recommended in cases when only a few transforms can be performed simultaneously. We show how the use of a different algorithm and of trigonometric tables will lead to more than three times faster execution times. The times for large transforms increase only about 39

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 68A10, 42A68

Retrieve articles in all journals with MSC: 68A10, 42A68

Additional Information

PII: S 0025-5718(81)99783-0
Article copyright: © Copyright 1981 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