annotate fft/fftw/fftw-3.3.4/doc/acknowledgements.texi @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 @node Acknowledgments, License and Copyright, Installation and Customization, Top
Chris@19 2 @chapter Acknowledgments
Chris@19 3
Chris@19 4 Matteo Frigo was supported in part by the Special Research Program SFB
Chris@19 5 F011 ``AURORA'' of the Austrian Science Fund FWF and by MIT Lincoln
Chris@19 6 Laboratory. For previous versions of FFTW, he was supported in part by the
Chris@19 7 Defense Advanced Research Projects Agency (DARPA), under Grants
Chris@19 8 N00014-94-1-0985 and F30602-97-1-0270, and by a Digital Equipment
Chris@19 9 Corporation Fellowship.
Chris@19 10
Chris@19 11 Steven G. Johnson was supported in part by a Dept.@ of Defense NDSEG
Chris@19 12 Fellowship, an MIT Karl Taylor Compton Fellowship, and by the Materials
Chris@19 13 Research Science and Engineering Center program of the National Science
Chris@19 14 Foundation under award DMR-9400334.
Chris@19 15
Chris@19 16 Code for the Cell Broadband Engine was graciously donated to the FFTW
Chris@19 17 project by the IBM Austin Research Lab and included in fftw-3.2. (This
Chris@19 18 code was removed in fftw-3.3.)
Chris@19 19
Chris@19 20 Code for the MIPS paired-single SIMD support was graciously donated to
Chris@19 21 the FFTW project by CodeSourcery, Inc.
Chris@19 22
Chris@19 23 We are grateful to Sun Microsystems Inc.@ for its donation of a
Chris@19 24 cluster of 9 8-processor Ultra HPC 5000 SMPs (24 Gflops peak). These
Chris@19 25 machines served as the primary platform for the development of early
Chris@19 26 versions of FFTW.
Chris@19 27
Chris@19 28 We thank Intel Corporation for donating a four-processor Pentium Pro
Chris@19 29 machine. We thank the GNU/Linux community for giving us a decent OS to
Chris@19 30 run on that machine.
Chris@19 31
Chris@19 32 We are thankful to the AMD corporation for donating an AMD Athlon XP 1700+
Chris@19 33 computer to the FFTW project.
Chris@19 34
Chris@19 35 We thank the Compaq/HP testdrive program and VA Software Corporation
Chris@19 36 (SourceForge.net) for providing remote access to machines that were used
Chris@19 37 to test FFTW.
Chris@19 38
Chris@19 39 The @code{genfft} suite of code generators was written using Objective
Chris@19 40 Caml, a dialect of ML. Objective Caml is a small and elegant language
Chris@19 41 developed by Xavier Leroy. The implementation is available from
Chris@19 42 @uref{http://caml.inria.fr/, @code{http://caml.inria.fr/}}. In previous
Chris@19 43 releases of FFTW, @code{genfft} was written in Caml Light, by the same
Chris@19 44 authors. An even earlier implementation of @code{genfft} was written in
Chris@19 45 Scheme, but Caml is definitely better for this kind of application.
Chris@19 46 @cindex Caml
Chris@19 47 @cindex LISP
Chris@19 48
Chris@19 49
Chris@19 50 FFTW uses many tools from the GNU project, including @code{automake},
Chris@19 51 @code{texinfo}, and @code{libtool}.
Chris@19 52
Chris@19 53 Prof.@ Charles E.@ Leiserson of MIT provided continuous support and
Chris@19 54 encouragement. This program would not exist without him. Charles also
Chris@19 55 proposed the name ``codelets'' for the basic FFT blocks.
Chris@19 56 @cindex codelet
Chris@19 57
Chris@19 58
Chris@19 59 Prof.@ John D.@ Joannopoulos of MIT demonstrated continuing tolerance of
Chris@19 60 Steven's ``extra-curricular'' computer-science activities, as well as
Chris@19 61 remarkable creativity in working them into his grant proposals.
Chris@19 62 Steven's physics degree would not exist without him.
Chris@19 63
Chris@19 64 Franz Franchetti wrote SIMD extensions to FFTW 2, which eventually
Chris@19 65 led to the SIMD support in FFTW 3.
Chris@19 66
Chris@19 67 Stefan Kral wrote most of the K7 code generator distributed with FFTW
Chris@19 68 3.0.x and 3.1.x.
Chris@19 69
Chris@19 70 Andrew Sterian contributed the Windows timing code in FFTW 2.
Chris@19 71
Chris@19 72 Didier Miras reported a bug in the test procedure used in FFTW 1.2. We
Chris@19 73 now use a completely different test algorithm by Funda Ergun that does
Chris@19 74 not require a separate FFT program to compare against.
Chris@19 75
Chris@19 76 Wolfgang Reimer contributed the Pentium cycle counter and a few fixes
Chris@19 77 that help portability.
Chris@19 78
Chris@19 79 Ming-Chang Liu uncovered a well-hidden bug in the complex transforms of
Chris@19 80 FFTW 2.0 and supplied a patch to correct it.
Chris@19 81
Chris@19 82 The FFTW FAQ was written in @code{bfnn} (Bizarre Format With No Name)
Chris@19 83 and formatted using the tools developed by Ian Jackson for the Linux
Chris@19 84 FAQ.
Chris@19 85
Chris@19 86 @emph{We are especially thankful to all of our users for their
Chris@19 87 continuing support, feedback, and interest during our development of
Chris@19 88 FFTW.}
Chris@19 89