A new Truncated Fourier Transform algorithm
Symbolic Computation
2013-01-30 v3
Abstract
Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in terms of ring operations, is comparable to existing not-in-place TFT methods. We also describe a transformation that maps between two families of TFT algorithms that use different sets of evaluation points.
Cite
@article{arxiv.1210.4960,
title = {A new Truncated Fourier Transform algorithm},
author = {Andrew Arnold},
journal= {arXiv preprint arXiv:1210.4960},
year = {2013}
}
Comments
8 pages, submitted to the 38th International Symposium on Symbolic and Algebraic Computation (ISSAC 2013)