Andrew Arnold
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 asymptotically equivalent 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.
- J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297--301, 1965.Google Scholar
Cross Ref
- R. Crandall. Advanced Topics in Scientic Computation. Springer-Verlag, 1996. ISBN 0-387-94473-7. Google ScholarDigital Library
- R. Crandall and B. Fagin. Discrete weighted transforms and large-integer arithmetic. Math. Comp., 62(205):305--324, 1994. Google ScholarDigital Library
- J. V. Z. Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 2nd edition, 2003. Google ScholarDigital Library
- D. Harvey and D. S. Roche. An in-place truncated Fourier transform and applications to polynomial multiplication. In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pages 325{329, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- M. Heideman, D. Johnson, and C. Burrus. Gauss and the history of the fast Fourier transform. ASSP Magazine, IEEE, 1(4):14--21, 1984.Google ScholarCross Ref
- T. Mateer. Fast Fourier Transform Algorithms with Applications. Master's thesis, Clemson University, 2008. Google ScholarDigital Library
- D. Roche. Efficient Computation With Sparse and Dense Polynomials. PhD thesis, University of Waterloo, 2011.Google Scholar
- I. S. Sergeev. Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform. Prikl. Diskr. Mat., pages 72--88, 2011. (Russian) http://mi.mathnet.ru/eng/pdm347.Google Scholar
- J. van der Hoeven. The Truncated Fourier Transform and Applications. In J. Gutierrez, editor, Proc. ISSAC 2004, pages 290{296, Univ. of Cantabria, Santander, Spain, July 4-7 2004. Google ScholarDigital Library
- J. van der Hoeven. Notes on the Truncated Fourier Transform. Technical Report 2005-5, Universitá Paris-Sud, Orsay, France, 2005.Google Scholar
Index Terms
- A new truncated fourier transform algorithm
Recommendations
An in-place truncated fourier transform and applications to polynomial multiplication
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationThe truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these jumps in ...
An in-place truncated Fourier transform
AbstractWe 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.
A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform
In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the ...
Comments