annotate src/fftw-3.3.5/doc/html/1d-Real_002deven-DFTs-_0028DCTs_0029.html @ 79:91c729825bca pa_catalina

Update build for AUDIO_COMPONENT_FIX
author Chris Cannam
date Wed, 30 Oct 2019 12:40:34 +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: 1d Real-even DFTs (DCTs)</title>
Chris@42 26
Chris@42 27 <meta name="description" content="FFTW 3.3.5: 1d Real-even DFTs (DCTs)">
Chris@42 28 <meta name="keywords" content="FFTW 3.3.5: 1d Real-even DFTs (DCTs)">
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="1d-Real_002dodd-DFTs-_0028DSTs_0029.html#g_t1d-Real_002dodd-DFTs-_0028DSTs_0029" rel="next" title="1d Real-odd DFTs (DSTs)">
Chris@42 38 <link href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" rel="prev" title="The 1d Real-data DFT">
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="g_t1d-Real_002deven-DFTs-_0028DCTs_0029"></a>
Chris@42 73 <div class="header">
Chris@42 74 <p>
Chris@42 75 Next: <a href="1d-Real_002dodd-DFTs-_0028DSTs_0029.html#g_t1d-Real_002dodd-DFTs-_0028DSTs_0029" accesskey="n" rel="next">1d Real-odd DFTs (DSTs)</a>, Previous: <a href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" accesskey="p" rel="prev">The 1d Real-data DFT</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="g_t1d-Real_002deven-DFTs-_0028DCTs_0029-1"></a>
Chris@42 79 <h4 class="subsection">4.8.3 1d Real-even DFTs (DCTs)</h4>
Chris@42 80
Chris@42 81 <p>The Real-even symmetry DFTs in FFTW are exactly equivalent to the unnormalized
Chris@42 82 forward (and backward) DFTs as defined above, where the input array
Chris@42 83 <em>X</em> of length <em>N</em> is purely real and is also <em>even</em> symmetry. In
Chris@42 84 this case, the output array is likewise real and even symmetry.
Chris@42 85 <a name="index-real_002deven-DFT-1"></a>
Chris@42 86 <a name="index-REDFT-1"></a>
Chris@42 87 </p>
Chris@42 88
Chris@42 89 <a name="index-REDFT00"></a>
Chris@42 90 <p>For the case of <code>REDFT00</code>, this even symmetry means that
Chris@42 91 <i>X<sub>j</sub> = X<sub>N-j</sub></i>,where we take <em>X</em> to be periodic so that
Chris@42 92 <i>X<sub>N</sub> = X</i><sub>0</sub>.Because of this redundancy, only the first <em>n</em> real numbers are
Chris@42 93 actually stored, where <em>N = 2(n-1)</em>.
Chris@42 94 </p>
Chris@42 95 <p>The proper definition of even symmetry for <code>REDFT10</code>,
Chris@42 96 <code>REDFT01</code>, and <code>REDFT11</code> transforms is somewhat more intricate
Chris@42 97 because of the shifts by <em>1/2</em> of the input and/or output, although
Chris@42 98 the corresponding boundary conditions are given in <a href="Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029.html#Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029">Real even/odd DFTs (cosine/sine transforms)</a>. Because of the even symmetry, however,
Chris@42 99 the sine terms in the DFT all cancel and the remaining cosine terms are
Chris@42 100 written explicitly below. This formulation often leads people to call
Chris@42 101 such a transform a <em>discrete cosine transform</em> (DCT), although it is
Chris@42 102 really just a special case of the DFT.
Chris@42 103 <a name="index-discrete-cosine-transform-2"></a>
Chris@42 104 <a name="index-DCT-2"></a>
Chris@42 105 </p>
Chris@42 106
Chris@42 107 <p>In each of the definitions below, we transform a real array <em>X</em> of
Chris@42 108 length <em>n</em> to a real array <em>Y</em> of length <em>n</em>:
Chris@42 109 </p>
Chris@42 110 <a name="REDFT00-_0028DCT_002dI_0029"></a>
Chris@42 111 <h4 class="subsubheading">REDFT00 (DCT-I)</h4>
Chris@42 112 <a name="index-REDFT00-1"></a>
Chris@42 113 <p>An <code>REDFT00</code> transform (type-I DCT) in FFTW is defined by:
Chris@42 114 <center><img src="equation-redft00.png" align="top">.</center>Note that this transform is not defined for <em>n=1</em>. For <em>n=2</em>,
Chris@42 115 the summation term above is dropped as you might expect.
Chris@42 116 </p>
Chris@42 117 <a name="REDFT10-_0028DCT_002dII_0029"></a>
Chris@42 118 <h4 class="subsubheading">REDFT10 (DCT-II)</h4>
Chris@42 119 <a name="index-REDFT10"></a>
Chris@42 120 <p>An <code>REDFT10</code> transform (type-II DCT, sometimes called &ldquo;the&rdquo; DCT) in FFTW is defined by:
Chris@42 121 <center><img src="equation-redft10.png" align="top">.</center></p>
Chris@42 122 <a name="REDFT01-_0028DCT_002dIII_0029"></a>
Chris@42 123 <h4 class="subsubheading">REDFT01 (DCT-III)</h4>
Chris@42 124 <a name="index-REDFT01"></a>
Chris@42 125 <p>An <code>REDFT01</code> transform (type-III DCT) in FFTW is defined by:
Chris@42 126 <center><img src="equation-redft01.png" align="top">.</center>In the case of <em>n=1</em>, this reduces to
Chris@42 127 <i>Y</i><sub>0</sub> = <i>X</i><sub>0</sub>.Up to a scale factor (see below), this is the inverse of <code>REDFT10</code> (&ldquo;the&rdquo; DCT), and so the <code>REDFT01</code> (DCT-III) is sometimes called the &ldquo;IDCT&rdquo;.
Chris@42 128 <a name="index-IDCT-3"></a>
Chris@42 129 </p>
Chris@42 130 <a name="REDFT11-_0028DCT_002dIV_0029"></a>
Chris@42 131 <h4 class="subsubheading">REDFT11 (DCT-IV)</h4>
Chris@42 132 <a name="index-REDFT11"></a>
Chris@42 133 <p>An <code>REDFT11</code> transform (type-IV DCT) in FFTW is defined by:
Chris@42 134 <center><img src="equation-redft11.png" align="top">.</center></p>
Chris@42 135 <a name="Inverses-and-Normalization"></a>
Chris@42 136 <h4 class="subsubheading">Inverses and Normalization</h4>
Chris@42 137
Chris@42 138 <p>These definitions correspond directly to the unnormalized DFTs used
Chris@42 139 elsewhere in FFTW (hence the factors of <em>2</em> in front of the
Chris@42 140 summations). The unnormalized inverse of <code>REDFT00</code> is
Chris@42 141 <code>REDFT00</code>, of <code>REDFT10</code> is <code>REDFT01</code> and vice versa, and
Chris@42 142 of <code>REDFT11</code> is <code>REDFT11</code>. Each unnormalized inverse results
Chris@42 143 in the original array multiplied by <em>N</em>, where <em>N</em> is the
Chris@42 144 <em>logical</em> DFT size. For <code>REDFT00</code>, <em>N=2(n-1)</em> (note that
Chris@42 145 <em>n=1</em> is not defined); otherwise, <em>N=2n</em>.
Chris@42 146 <a name="index-normalization-10"></a>
Chris@42 147 </p>
Chris@42 148
Chris@42 149 <p>In defining the discrete cosine transform, some authors also include
Chris@42 150 additional factors of
Chris@42 151 &radic;2(or its inverse) multiplying selected inputs and/or outputs. This is a
Chris@42 152 mostly cosmetic change that makes the transform orthogonal, but
Chris@42 153 sacrifices the direct equivalence to a symmetric DFT.
Chris@42 154 </p>
Chris@42 155 <hr>
Chris@42 156 <div class="header">
Chris@42 157 <p>
Chris@42 158 Next: <a href="1d-Real_002dodd-DFTs-_0028DSTs_0029.html#g_t1d-Real_002dodd-DFTs-_0028DSTs_0029" accesskey="n" rel="next">1d Real-odd DFTs (DSTs)</a>, Previous: <a href="The-1d-Real_002ddata-DFT.html#The-1d-Real_002ddata-DFT" accesskey="p" rel="prev">The 1d Real-data DFT</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 159 </div>
Chris@42 160
Chris@42 161
Chris@42 162
Chris@42 163 </body>
Chris@42 164 </html>