An in-place truncated Fourier transform
Computational Complexity
2021-01-25 v1 Data Structures and Algorithms
Abstract
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
Keywords
Cite
@article{arxiv.2101.09005,
title = {An in-place truncated Fourier transform},
author = {Nicholas Coxon},
journal= {arXiv preprint arXiv:2101.09005},
year = {2021}
}