Super fast Fourier transform

Sos С. Agaian, Okan CaglayanProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2006 · DOI

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).
BibTeX
@inproceedings{agaian2006super,
  author = {Sos С. Agaian and Okan Caglayan},
  title = {{Super fast Fourier transform}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2006},
  doi = {10.1117/12.643648},
}

Loading related content...

Figure