annotate Lib/fftw-3.2.1/doc/html/.svn/text-base/Real_002dto_002dReal-Transform-Kinds.html.svn-base @ 12:761289a660c6

Fixed Spectral Contrast and Periodicity
author Geogaddi\David <d.m.ronan@qmul.ac.uk>
date Mon, 17 Aug 2015 19:16:33 +0100
parents 25bf17994ef1
children
rev   line source
d@0 1 <html lang="en">
d@0 2 <head>
d@0 3 <title>Real-to-Real Transform Kinds - FFTW 3.2.1</title>
d@0 4 <meta http-equiv="Content-Type" content="text/html">
d@0 5 <meta name="description" content="FFTW 3.2.1">
d@0 6 <meta name="generator" content="makeinfo 4.8">
d@0 7 <link title="Top" rel="start" href="index.html#Top">
d@0 8 <link rel="up" href="Basic-Interface.html#Basic-Interface" title="Basic Interface">
d@0 9 <link rel="prev" href="Real_002dto_002dReal-Transforms.html#Real_002dto_002dReal-Transforms" title="Real-to-Real Transforms">
d@0 10 <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
d@0 11 <!--
d@0 12 This manual is for FFTW
d@0 13 (version 3.2.1, 5 February 2009).
d@0 14
d@0 15 Copyright (C) 2003 Matteo Frigo.
d@0 16
d@0 17 Copyright (C) 2003 Massachusetts Institute of Technology.
d@0 18
d@0 19 Permission is granted to make and distribute verbatim copies of
d@0 20 this manual provided the copyright notice and this permission
d@0 21 notice are preserved on all copies.
d@0 22
d@0 23 Permission is granted to copy and distribute modified versions of
d@0 24 this manual under the conditions for verbatim copying, provided
d@0 25 that the entire resulting derived work is distributed under the
d@0 26 terms of a permission notice identical to this one.
d@0 27
d@0 28 Permission is granted to copy and distribute translations of this
d@0 29 manual into another language, under the above conditions for
d@0 30 modified versions, except that this permission notice may be
d@0 31 stated in a translation approved by the Free Software Foundation.
d@0 32 -->
d@0 33 <meta http-equiv="Content-Style-Type" content="text/css">
d@0 34 <style type="text/css"><!--
d@0 35 pre.display { font-family:inherit }
d@0 36 pre.format { font-family:inherit }
d@0 37 pre.smalldisplay { font-family:inherit; font-size:smaller }
d@0 38 pre.smallformat { font-family:inherit; font-size:smaller }
d@0 39 pre.smallexample { font-size:smaller }
d@0 40 pre.smalllisp { font-size:smaller }
d@0 41 span.sc { font-variant:small-caps }
d@0 42 span.roman { font-family:serif; font-weight:normal; }
d@0 43 span.sansserif { font-family:sans-serif; font-weight:normal; }
d@0 44 --></style>
d@0 45 </head>
d@0 46 <body>
d@0 47 <div class="node">
d@0 48 <p>
d@0 49 <a name="Real-to-Real-Transform-Kinds"></a>
d@0 50 <a name="Real_002dto_002dReal-Transform-Kinds"></a>
d@0 51 Previous:&nbsp;<a rel="previous" accesskey="p" href="Real_002dto_002dReal-Transforms.html#Real_002dto_002dReal-Transforms">Real-to-Real Transforms</a>,
d@0 52 Up:&nbsp;<a rel="up" accesskey="u" href="Basic-Interface.html#Basic-Interface">Basic Interface</a>
d@0 53 <hr>
d@0 54 </div>
d@0 55
d@0 56 <h4 class="subsection">4.3.6 Real-to-Real Transform Kinds</h4>
d@0 57
d@0 58 <p><a name="index-kind-_0028r2r_0029-203"></a>
d@0 59 FFTW currently supports 11 different r2r transform kinds, specified by
d@0 60 one of the constants below. For the precise definitions of these
d@0 61 transforms, see <a href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes">What FFTW Really Computes</a>. For a more colloquial
d@0 62 introduction to these transform kinds, see <a href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data">More DFTs of Real Data</a>.
d@0 63
d@0 64 <p>For dimension of size <code>n</code>, there is a corresponding &ldquo;logical&rdquo;
d@0 65 dimension <code>N</code> that determines the normalization (and the optimal
d@0 66 factorization); the formula for <code>N</code> is given for each kind below.
d@0 67 Also, with each transform kind is listed its corrsponding inverse
d@0 68 transform. FFTW computes unnormalized transforms: a transform followed
d@0 69 by its inverse will result in the original data multiplied by <code>N</code>
d@0 70 (or the product of the <code>N</code>'s for each dimension, in
d@0 71 multi-dimensions).
d@0 72 <a name="index-normalization-204"></a>
d@0 73 <ul>
d@0 74 <li><a name="index-FFTW_005fR2HC-205"></a><code>FFTW_R2HC</code> computes a real-input DFT with output in
d@0 75 &ldquo;halfcomplex&rdquo; format, i.e. real and imaginary parts for a transform of
d@0 76 size <code>n</code> stored as:
d@0 77 <p align=center>
d@0 78 r<sub>0</sub>, r<sub>1</sub>, r<sub>2</sub>, ..., r<sub>n/2</sub>, i<sub>(n+1)/2-1</sub>, ..., i<sub>2</sub>, i<sub>1</sub>
d@0 79 </p>(Logical <code>N=n</code>, inverse is <code>FFTW_HC2R</code>.)
d@0 80
d@0 81 <li><a name="index-FFTW_005fHC2R-206"></a><code>FFTW_HC2R</code> computes the reverse of <code>FFTW_R2HC</code>, above.
d@0 82 (Logical <code>N=n</code>, inverse is <code>FFTW_R2HC</code>.)
d@0 83
d@0 84 <li><a name="index-FFTW_005fDHT-207"></a><code>FFTW_DHT</code> computes a discrete Hartley transform.
d@0 85 (Logical <code>N=n</code>, inverse is <code>FFTW_DHT</code>.)
d@0 86 <a name="index-discrete-Hartley-transform-208"></a>
d@0 87 <li><a name="index-FFTW_005fREDFT00-209"></a><code>FFTW_REDFT00</code> computes an REDFT00 transform, i.e. a DCT-I.
d@0 88 (Logical <code>N=2*(n-1)</code>, inverse is <code>FFTW_REDFT00</code>.)
d@0 89 <a name="index-discrete-cosine-transform-210"></a><a name="index-DCT-211"></a>
d@0 90 <li><a name="index-FFTW_005fREDFT10-212"></a><code>FFTW_REDFT10</code> computes an REDFT10 transform, i.e. a DCT-II (sometimes called &ldquo;the&rdquo; DCT).
d@0 91 (Logical <code>N=2*n</code>, inverse is <code>FFTW_REDFT01</code>.)
d@0 92
d@0 93 <li><a name="index-FFTW_005fREDFT01-213"></a><code>FFTW_REDFT01</code> computes an REDFT01 transform, i.e. a DCT-III (sometimes called &ldquo;the&rdquo; IDCT, being the inverse of DCT-II).
d@0 94 (Logical <code>N=2*n</code>, inverse is <code>FFTW_REDFT=10</code>.)
d@0 95 <a name="index-IDCT-214"></a>
d@0 96 <li><a name="index-FFTW_005fREDFT11-215"></a><code>FFTW_REDFT11</code> computes an REDFT11 transform, i.e. a DCT-IV.
d@0 97 (Logical <code>N=2*n</code>, inverse is <code>FFTW_REDFT11</code>.)
d@0 98
d@0 99 <li><a name="index-FFTW_005fRODFT00-216"></a><code>FFTW_RODFT00</code> computes an RODFT00 transform, i.e. a DST-I.
d@0 100 (Logical <code>N=2*(n+1)</code>, inverse is <code>FFTW_RODFT00</code>.)
d@0 101 <a name="index-discrete-sine-transform-217"></a><a name="index-DST-218"></a>
d@0 102 <li><a name="index-FFTW_005fRODFT10-219"></a><code>FFTW_RODFT10</code> computes an RODFT10 transform, i.e. a DST-II.
d@0 103 (Logical <code>N=2*n</code>, inverse is <code>FFTW_RODFT01</code>.)
d@0 104
d@0 105 <li><a name="index-FFTW_005fRODFT01-220"></a><code>FFTW_RODFT01</code> computes an RODFT01 transform, i.e. a DST-III.
d@0 106 (Logical <code>N=2*n</code>, inverse is <code>FFTW_RODFT=10</code>.)
d@0 107
d@0 108 <li><a name="index-FFTW_005fRODFT11-221"></a><code>FFTW_RODFT11</code> computes an RODFT11 transform, i.e. a DST-IV.
d@0 109 (Logical <code>N=2*n</code>, inverse is <code>FFTW_RODFT11</code>.)
d@0 110
d@0 111 </ul>
d@0 112
d@0 113 <!-- -->
d@0 114 </body></html>
d@0 115