aboutsummaryrefslogtreecommitdiff
path: root/math/fftw/pkg-descr
diff options
context:
space:
mode:
authorSatoshi Taoka <taoka@FreeBSD.org>1999-03-18 08:38:33 +0000
committerSatoshi Taoka <taoka@FreeBSD.org>1999-03-18 08:38:33 +0000
commit8d087a6cf09331f49618430b0d609cc79134b723 (patch)
treec8937a66b1fd7a8fbec5282c96ed0d89d9e51325 /math/fftw/pkg-descr
parent42d57a80e550d99534e6046defa1a5ec5a99df78 (diff)
Fast C routines library to compute the Discrete Fourier Transform
PR: ports/9222 Submitted by: Lars Koeller lkoeller@cc.fh-lippe.de
Notes
Notes: svn path=/head/; revision=17276
Diffstat (limited to 'math/fftw/pkg-descr')
-rw-r--r--math/fftw/pkg-descr12
1 files changed, 12 insertions, 0 deletions
diff --git a/math/fftw/pkg-descr b/math/fftw/pkg-descr
new file mode 100644
index 000000000000..46dcef355057
--- /dev/null
+++ b/math/fftw/pkg-descr
@@ -0,0 +1,12 @@
+
+ FFTW, the Fastest Fourier Transform in the West. FFTW is a comprehensive
+ collection of fast C routines for computing the discrete Fourier transform
+ (DFT) in one or more dimensions, of both real and complex data, and of
+ arbitrary input size. FFTW also includes parallel transforms, documented
+ elsewhere. We assume herein that the reader is already familiar with the
+ properties and uses of the DFT that are relevant to her application.
+ Otherwise, see e.g. `The Fast Fourier Transform' by E. O. Brigham
+ (Prentice-Hall, Englewood Cliffs, NJ, 1974). Our web page also has links to
+ FFT-related information online, see
+
+ http://theory.lcs.mit.edu/~fftw