Super-fast Fourier transform

Sos S. Agaian; Okan Caglayan

doi:10.1117/12.643648

16 February 2006 Super fast Fourier transform

Sos S. Agaian, Okan Caglayan

Proceedings Volume 6064, Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning; 60640F (2006) https://doi.org/10.1117/12.643648
Event: Electronic Imaging 2006, 2006, San Jose, California, United States

Abstract

In this paper, we have developed the recursive fast orthogonal mapping algorithms based fast Fourier transforms. Particularly, we introduced a new fast Fourier transform algorithm with linear multiplicative complexity. The proposed algorithms not only reduces the multiplicative complexity, but also is comparable to the existing methods such as Duhamel, Heideman, Burrus, Vetterli, Wang [11,15,16,19,21,27,28] in the total number of operations (arithmetic complexity, or the number of multiplications and additions).

Citation Download Citation

Sos S. Agaian and Okan Caglayan "Super fast Fourier transform", Proc. SPIE 6064, Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, 60640F (16 February 2006); https://doi.org/10.1117/12.643648

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available