English

An Illustrated Introduction to the Truncated Fourier Transform

Symbolic Computation 2016-02-18 v2

Abstract

The Truncated Fourier Transform (TFT) is a variation of the Discrete Fourier Transform (DFT/FFT) that allows for input vectors that do NOT have length 2n2^n for nn a positive integer. We present the univariate version of the TFT, originally due to Joris van der Hoeven, heavily illustrating the presentation in order to make these methods accessible to a broader audience.

Keywords

Cite

@article{arxiv.1602.04562,
  title  = {An Illustrated Introduction to the Truncated Fourier Transform},
  author = {Paul Vrbik},
  journal= {arXiv preprint arXiv:1602.04562},
  year   = {2016}
}