Share Email Print
cover

Proceedings Paper

Super fast Fourier transform
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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).

Paper Details

Date Published: 16 February 2006
PDF: 12 pages
Proc. SPIE 6064, Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, 60640F (16 February 2006); doi: 10.1117/12.643648
Show Author Affiliations
Sos S. Agaian, Univ. of Texas at San Antonio (United States)
Okan Caglayan, Univ. of Texas at San Antonio (United States)


Published in SPIE Proceedings Vol. 6064:
Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning
Nasser M. Nasrabadi; Edward R. Dougherty; Jaakko T. Astola; Syed A. Rizvi; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top