Content deleted Content added
→External links: at the least, we should keep the link to fftw.org/links.html, since that provides a large number of web links directly relevant to this article |
|||
Line 99:
* Cooley, James W., and [[John W. Tukey]], 1965, "An algorithm for the machine calculation of complex Fourier series," ''Math. Comput.'' '''19''': 297–301.
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]], 2001. ''[[Introduction to Algorithms]]'', 2nd. ed. MIT Press and McGraw-Hill. ISBN 0-262-03293-7. Especially chapter 30, "Polynomials and the FFT."
* Pierre Duhamel, 1990, "Algorithms meeting the lower bounds on the multiplicative complexity of length-<math>2^n</math> DFTs and their connection with practical algorithms," ''IEEE Trans. Acoust. Speech. Sig. Proc.'' '''38''': 1504-
* ------- and M. Vetterli, 1990, "Fast Fourier transforms: a tutorial review and a state of the art," ''Signal Processing'' '''19''': 259–299.
* A. Edelman, P. McCorquodale, and S. Toledo, 1999, "The future fast Fourier transform?" ''SIAM J. Sci. Computing'' '''20''': 1094–1114.
| |||