16 February 2006 Super fast Fourier transform
Author Affiliations +
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).
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sos S. Agaian, Okan Caglayan, "Super fast Fourier transform", Proc. SPIE 6064, Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, 60640F (16 February 2006); doi: 10.1117/12.643648; https://doi.org/10.1117/12.643648
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top