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