An in-place truncated Fourier transform
Nicholas Coxon (GRACE)
TL;DR
This paper presents a modification to the truncated Fourier transform algorithms enabling in-place computation with minimal additional complexity, improving efficiency for practical applications.
Contribution
It introduces simple modifications to existing truncated Fourier transform algorithms to perform in-place computations with linear overhead.
Findings
Transform algorithms now operate in-place
Linear overhead in computational complexity
Enhanced efficiency for Fourier transforms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.