18.11.3 Reference (2D Fourier Transforms)

  1. James W. Cooley and John W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19, 297-301 (1965).
  2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Chapter 30: Polynomials and the FFT, pp.822-848.
  3. Matteo Frigo and Steven G. Johnson: FFTW, http://www.fftw.org/.
  4. M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Proceedings of the IEEE 93 (2), 216-231 (2005).
  5. James C. Schatzman, Accuracy of the discrete Fourier transform and the fast Fourier transform, SIAM J. Sci. Comput. 17 (5), 1150-1166 (1996).
  6. R. Tolimieri, M. An, C. Lu. Mathematics of Multidimensional Fourier Transform Algorithms, Springer-Verlag, New York, 1993.
  7. William H. Press, et al. 1992. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press