annotate src/fftw-3.3.5/doc/html/The-1d-Discrete-Fourier-Transform-_0028DFT_0029.html @ 81:7029a4916348

Merge build update
author Chris Cannam
date Thu, 31 Oct 2019 13:36:58 +0000
parents 2cd0e3b3e1fd
children
rev   line source
Chris@42 1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
Chris@42 2 <html>
Chris@42 3 <!-- This manual is for FFTW
Chris@42 4 (version 3.3.5, 30 July 2016).
Chris@42 5
Chris@42 6 Copyright (C) 2003 Matteo Frigo.
Chris@42 7
Chris@42 8 Copyright (C) 2003 Massachusetts Institute of Technology.
Chris@42 9
Chris@42 10 Permission is granted to make and distribute verbatim copies of this
Chris@42 11 manual provided the copyright notice and this permission notice are
Chris@42 12 preserved on all copies.
Chris@42 13
Chris@42 14 Permission is granted to copy and distribute modified versions of this
Chris@42 15 manual under the conditions for verbatim copying, provided that the
Chris@42 16 entire resulting derived work is distributed under the terms of a
Chris@42 17 permission notice identical to this one.
Chris@42 18
Chris@42 19 Permission is granted to copy and distribute translations of this manual
Chris@42 20 into another language, under the above conditions for modified versions,
Chris@42 21 except that this permission notice may be stated in a translation
Chris@42 22 approved by the Free Software Foundation. -->
Chris@42 23 <!-- Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ -->
Chris@42 24 <head>
Chris@42 25 <title>FFTW 3.3.5: The 1d Discrete Fourier Transform (DFT)</title>
Chris@42 26
Chris@42 27 <meta name="description" content="FFTW 3.3.5: The 1d Discrete Fourier Transform (DFT)">
Chris@42 28 <meta name="keywords" content="FFTW 3.3.5: The 1d Discrete Fourier Transform (DFT)">
Chris@42 29 <meta name="resource-type" content="document">
Chris@42 30 <meta name="distribution" content="global">
Chris@42 31 <meta name="Generator" content="makeinfo">
Chris@42 32 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
Chris@42 33 <link href="index.html#Top" rel="start" title="Top">
Chris@42 34 <link href="Concept-Index.html#Concept-Index" rel="index" title="Concept Index">
Chris@42 35 <link href="index.html#SEC_Contents" rel="contents" title="Table of Contents">
Chris@42 36 <link href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" rel="up" title="What FFTW Really Computes">
Chris@42 37 <link href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" rel="next" title="The 1d Real-data DFT">
Chris@42 38 <link href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" rel="prev" title="What FFTW Really Computes">
Chris@42 39 <style type="text/css">
Chris@42 40 <!--
Chris@42 41 a.summary-letter {text-decoration: none}
Chris@42 42 blockquote.smallquotation {font-size: smaller}
Chris@42 43 div.display {margin-left: 3.2em}
Chris@42 44 div.example {margin-left: 3.2em}
Chris@42 45 div.indentedblock {margin-left: 3.2em}
Chris@42 46 div.lisp {margin-left: 3.2em}
Chris@42 47 div.smalldisplay {margin-left: 3.2em}
Chris@42 48 div.smallexample {margin-left: 3.2em}
Chris@42 49 div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
Chris@42 50 div.smalllisp {margin-left: 3.2em}
Chris@42 51 kbd {font-style:oblique}
Chris@42 52 pre.display {font-family: inherit}
Chris@42 53 pre.format {font-family: inherit}
Chris@42 54 pre.menu-comment {font-family: serif}
Chris@42 55 pre.menu-preformatted {font-family: serif}
Chris@42 56 pre.smalldisplay {font-family: inherit; font-size: smaller}
Chris@42 57 pre.smallexample {font-size: smaller}
Chris@42 58 pre.smallformat {font-family: inherit; font-size: smaller}
Chris@42 59 pre.smalllisp {font-size: smaller}
Chris@42 60 span.nocodebreak {white-space:nowrap}
Chris@42 61 span.nolinebreak {white-space:nowrap}
Chris@42 62 span.roman {font-family:serif; font-weight:normal}
Chris@42 63 span.sansserif {font-family:sans-serif; font-weight:normal}
Chris@42 64 ul.no-bullet {list-style: none}
Chris@42 65 -->
Chris@42 66 </style>
Chris@42 67
Chris@42 68
Chris@42 69 </head>
Chris@42 70
Chris@42 71 <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
Chris@42 72 <a name="The-1d-Discrete-Fourier-Transform-_0028DFT_0029"></a>
Chris@42 73 <div class="header">
Chris@42 74 <p>
Chris@42 75 Next: <a href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" accesskey="n" rel="next">The 1d Real-data DFT</a>, Previous: <a href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" accesskey="p" rel="prev">What FFTW Really Computes</a>, Up: <a href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes" accesskey="u" rel="up">What FFTW Really Computes</a> &nbsp; [<a href="index.html#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="Concept-Index.html#Concept-Index" title="Index" rel="index">Index</a>]</p>
Chris@42 76 </div>
Chris@42 77 <hr>
Chris@42 78 <a name="The-1d-Discrete-Fourier-Transform-_0028DFT_0029-1"></a>
Chris@42 79 <h4 class="subsection">4.8.1 The 1d Discrete Fourier Transform (DFT)</h4>
Chris@42 80
Chris@42 81 <a name="index-discrete-Fourier-transform-1"></a>
Chris@42 82 <a name="index-DFT-2"></a>
Chris@42 83 <p>The forward (<code>FFTW_FORWARD</code>) discrete Fourier transform (DFT) of a
Chris@42 84 1d complex array <em>X</em> of size <em>n</em> computes an array <em>Y</em>,
Chris@42 85 where:
Chris@42 86 <center><img src="equation-dft.png" align="top">.</center>The backward (<code>FFTW_BACKWARD</code>) DFT computes:
Chris@42 87 <center><img src="equation-idft.png" align="top">.</center></p>
Chris@42 88 <a name="index-normalization-8"></a>
Chris@42 89 <p>FFTW computes an unnormalized transform, in that there is no coefficient
Chris@42 90 in front of the summation in the DFT. In other words, applying the
Chris@42 91 forward and then the backward transform will multiply the input by
Chris@42 92 <em>n</em>.
Chris@42 93 </p>
Chris@42 94 <a name="index-frequency-1"></a>
Chris@42 95 <p>From above, an <code>FFTW_FORWARD</code> transform corresponds to a sign of
Chris@42 96 <em>-1</em> in the exponent of the DFT. Note also that we use the
Chris@42 97 standard &ldquo;in-order&rdquo; output ordering&mdash;the <em>k</em>-th output
Chris@42 98 corresponds to the frequency <em>k/n</em> (or <em>k/T</em>, where <em>T</em>
Chris@42 99 is your total sampling period). For those who like to think in terms of
Chris@42 100 positive and negative frequencies, this means that the positive
Chris@42 101 frequencies are stored in the first half of the output and the negative
Chris@42 102 frequencies are stored in backwards order in the second half of the
Chris@42 103 output. (The frequency <em>-k/n</em> is the same as the frequency
Chris@42 104 <em>(n-k)/n</em>.)
Chris@42 105 </p>
Chris@42 106
Chris@42 107
Chris@42 108
Chris@42 109 </body>
Chris@42 110 </html>