annotate src/fftw-3.3.3/doc/html/The-1d-Discrete-Fourier-Transform-_0028DFT_0029.html @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 89f5e221ed7b
children
rev   line source
cannam@95 1 <html lang="en">
cannam@95 2 <head>
cannam@95 3 <title>The 1d Discrete Fourier Transform (DFT) - FFTW 3.3.3</title>
cannam@95 4 <meta http-equiv="Content-Type" content="text/html">
cannam@95 5 <meta name="description" content="FFTW 3.3.3">
cannam@95 6 <meta name="generator" content="makeinfo 4.13">
cannam@95 7 <link title="Top" rel="start" href="index.html#Top">
cannam@95 8 <link rel="up" href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" title="What FFTW Really Computes">
cannam@95 9 <link rel="prev" href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" title="What FFTW Really Computes">
cannam@95 10 <link rel="next" href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" title="The 1d Real-data DFT">
cannam@95 11 <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
cannam@95 12 <!--
cannam@95 13 This manual is for FFTW
cannam@95 14 (version 3.3.3, 25 November 2012).
cannam@95 15
cannam@95 16 Copyright (C) 2003 Matteo Frigo.
cannam@95 17
cannam@95 18 Copyright (C) 2003 Massachusetts Institute of Technology.
cannam@95 19
cannam@95 20 Permission is granted to make and distribute verbatim copies of
cannam@95 21 this manual provided the copyright notice and this permission
cannam@95 22 notice are preserved on all copies.
cannam@95 23
cannam@95 24 Permission is granted to copy and distribute modified versions of
cannam@95 25 this manual under the conditions for verbatim copying, provided
cannam@95 26 that the entire resulting derived work is distributed under the
cannam@95 27 terms of a permission notice identical to this one.
cannam@95 28
cannam@95 29 Permission is granted to copy and distribute translations of this
cannam@95 30 manual into another language, under the above conditions for
cannam@95 31 modified versions, except that this permission notice may be
cannam@95 32 stated in a translation approved by the Free Software Foundation.
cannam@95 33 -->
cannam@95 34 <meta http-equiv="Content-Style-Type" content="text/css">
cannam@95 35 <style type="text/css"><!--
cannam@95 36 pre.display { font-family:inherit }
cannam@95 37 pre.format { font-family:inherit }
cannam@95 38 pre.smalldisplay { font-family:inherit; font-size:smaller }
cannam@95 39 pre.smallformat { font-family:inherit; font-size:smaller }
cannam@95 40 pre.smallexample { font-size:smaller }
cannam@95 41 pre.smalllisp { font-size:smaller }
cannam@95 42 span.sc { font-variant:small-caps }
cannam@95 43 span.roman { font-family:serif; font-weight:normal; }
cannam@95 44 span.sansserif { font-family:sans-serif; font-weight:normal; }
cannam@95 45 --></style>
cannam@95 46 </head>
cannam@95 47 <body>
cannam@95 48 <div class="node">
cannam@95 49 <a name="The-1d-Discrete-Fourier-Transform-(DFT)"></a>
cannam@95 50 <a name="The-1d-Discrete-Fourier-Transform-_0028DFT_0029"></a>
cannam@95 51 <p>
cannam@95 52 Next:&nbsp;<a rel="next" accesskey="n" href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT">The 1d Real-data DFT</a>,
cannam@95 53 Previous:&nbsp;<a rel="previous" accesskey="p" href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes">What FFTW Really Computes</a>,
cannam@95 54 Up:&nbsp;<a rel="up" accesskey="u" href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes">What FFTW Really Computes</a>
cannam@95 55 <hr>
cannam@95 56 </div>
cannam@95 57
cannam@95 58 <h4 class="subsection">4.8.1 The 1d Discrete Fourier Transform (DFT)</h4>
cannam@95 59
cannam@95 60 <p><a name="index-discrete-Fourier-transform-292"></a><a name="index-DFT-293"></a>The forward (<code>FFTW_FORWARD</code>) discrete Fourier transform (DFT) of a
cannam@95 61 1d complex array X of size n computes an array Y,
cannam@95 62 where:
cannam@95 63 <center><img src="equation-dft.png" align="top">.</center>The backward (<code>FFTW_BACKWARD</code>) DFT computes:
cannam@95 64 <center><img src="equation-idft.png" align="top">.</center>
cannam@95 65
cannam@95 66 <p><a name="index-normalization-294"></a>FFTW computes an unnormalized transform, in that there is no coefficient
cannam@95 67 in front of the summation in the DFT. In other words, applying the
cannam@95 68 forward and then the backward transform will multiply the input by
cannam@95 69 n.
cannam@95 70
cannam@95 71 <p><a name="index-frequency-295"></a>From above, an <code>FFTW_FORWARD</code> transform corresponds to a sign of
cannam@95 72 -1 in the exponent of the DFT. Note also that we use the
cannam@95 73 standard &ldquo;in-order&rdquo; output ordering&mdash;the k-th output
cannam@95 74 corresponds to the frequency k/n (or k/T, where T
cannam@95 75 is your total sampling period). For those who like to think in terms of
cannam@95 76 positive and negative frequencies, this means that the positive
cannam@95 77 frequencies are stored in the first half of the output and the negative
cannam@95 78 frequencies are stored in backwards order in the second half of the
cannam@95 79 output. (The frequency -k/n is the same as the frequency
cannam@95 80 (n-k)/n.)
cannam@95 81
cannam@95 82 <!-- =========> -->
cannam@95 83 </body></html>
cannam@95 84