Referenz (2D-Fourier-Transformationen)

1. James W. Cooley und 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 und Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Kapitel 30: Polynomials and the FFT, S. 822–-848.
3. Matteo Frigo und Steven G. Johnson: FFTW, http://www.fftw.org/.
4. M. Frigo und 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. 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