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.

翻译：我们显示,简单修改范德霍芬的前方和逆截断的Fourier变换使算法能够在原地进行,并且只有线性间接费用的复杂程度。