Super Fast Fourier Transform

摘要

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 in the total number of operations (arithmetic complexity, or the number of multiplications and additions).