Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.8/doc/html/The-Discrete-Hartley-Transform.html @ 167:bd3cc4d1df30

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add FFTW 3.3.8 source, and a Linux build
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 19 Nov 2019 14:52:55 +0000
parents
children
rev   line source
cannam@167 1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
cannam@167 2 <html>
cannam@167 3 <!-- This manual is for FFTW
cannam@167 4 (version 3.3.8, 24 May 2018).
cannam@167 5
cannam@167 6 Copyright (C) 2003 Matteo Frigo.
cannam@167 7
cannam@167 8 Copyright (C) 2003 Massachusetts Institute of Technology.
cannam@167 9
cannam@167 10 Permission is granted to make and distribute verbatim copies of this
cannam@167 11 manual provided the copyright notice and this permission notice are
cannam@167 12 preserved on all copies.
cannam@167 13
cannam@167 14 Permission is granted to copy and distribute modified versions of this
cannam@167 15 manual under the conditions for verbatim copying, provided that the
cannam@167 16 entire resulting derived work is distributed under the terms of a
cannam@167 17 permission notice identical to this one.
cannam@167 18
cannam@167 19 Permission is granted to copy and distribute translations of this manual
cannam@167 20 into another language, under the above conditions for modified versions,
cannam@167 21 except that this permission notice may be stated in a translation
cannam@167 22 approved by the Free Software Foundation. -->
cannam@167 23 <!-- Created by GNU Texinfo 6.3, http://www.gnu.org/software/texinfo/ -->
cannam@167 24 <head>
cannam@167 25 <title>FFTW 3.3.8: The Discrete Hartley Transform</title>
cannam@167 26
cannam@167 27 <meta name="description" content="FFTW 3.3.8: The Discrete Hartley Transform">
cannam@167 28 <meta name="keywords" content="FFTW 3.3.8: The Discrete Hartley Transform">
cannam@167 29 <meta name="resource-type" content="document">
cannam@167 30 <meta name="distribution" content="global">
cannam@167 31 <meta name="Generator" content="makeinfo">
cannam@167 32 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
cannam@167 33 <link href="index.html#Top" rel="start" title="Top">
cannam@167 34 <link href="Concept-Index.html#Concept-Index" rel="index" title="Concept Index">
cannam@167 35 <link href="index.html#SEC_Contents" rel="contents" title="Table of Contents">
cannam@167 36 <link href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data" rel="up" title="More DFTs of Real Data">
cannam@167 37 <link href="Other-Important-Topics.html#Other-Important-Topics" rel="next" title="Other Important Topics">
cannam@167 38 <link href="Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029.html#Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029" rel="prev" title="Real even/odd DFTs (cosine/sine transforms)">
cannam@167 39 <style type="text/css">
cannam@167 40 <!--
cannam@167 41 a.summary-letter {text-decoration: none}
cannam@167 42 blockquote.indentedblock {margin-right: 0em}
cannam@167 43 blockquote.smallindentedblock {margin-right: 0em; font-size: smaller}
cannam@167 44 blockquote.smallquotation {font-size: smaller}
cannam@167 45 div.display {margin-left: 3.2em}
cannam@167 46 div.example {margin-left: 3.2em}
cannam@167 47 div.lisp {margin-left: 3.2em}
cannam@167 48 div.smalldisplay {margin-left: 3.2em}
cannam@167 49 div.smallexample {margin-left: 3.2em}
cannam@167 50 div.smalllisp {margin-left: 3.2em}
cannam@167 51 kbd {font-style: oblique}
cannam@167 52 pre.display {font-family: inherit}
cannam@167 53 pre.format {font-family: inherit}
cannam@167 54 pre.menu-comment {font-family: serif}
cannam@167 55 pre.menu-preformatted {font-family: serif}
cannam@167 56 pre.smalldisplay {font-family: inherit; font-size: smaller}
cannam@167 57 pre.smallexample {font-size: smaller}
cannam@167 58 pre.smallformat {font-family: inherit; font-size: smaller}
cannam@167 59 pre.smalllisp {font-size: smaller}
cannam@167 60 span.nolinebreak {white-space: nowrap}
cannam@167 61 span.roman {font-family: initial; font-weight: normal}
cannam@167 62 span.sansserif {font-family: sans-serif; font-weight: normal}
cannam@167 63 ul.no-bullet {list-style: none}
cannam@167 64 -->
cannam@167 65 </style>
cannam@167 66
cannam@167 67
cannam@167 68 </head>
cannam@167 69
cannam@167 70 <body lang="en">
cannam@167 71 <a name="The-Discrete-Hartley-Transform"></a>
cannam@167 72 <div class="header">
cannam@167 73 <p>
cannam@167 74 Previous: <a href="Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029.html#Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029" accesskey="p" rel="prev">Real even/odd DFTs (cosine/sine transforms)</a>, Up: <a href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data" accesskey="u" rel="up">More DFTs of Real Data</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>
cannam@167 75 </div>
cannam@167 76 <hr>
cannam@167 77 <a name="The-Discrete-Hartley-Transform-1"></a>
cannam@167 78 <h4 class="subsection">2.5.3 The Discrete Hartley Transform</h4>
cannam@167 79
cannam@167 80 <p>If you are planning to use the DHT because you&rsquo;ve heard that it is
cannam@167 81 &ldquo;faster&rdquo; than the DFT (FFT), <strong>stop here</strong>. The DHT is not
cannam@167 82 faster than the DFT. That story is an old but enduring misconception
cannam@167 83 that was debunked in 1987.
cannam@167 84 </p>
cannam@167 85 <p>The discrete Hartley transform (DHT) is an invertible linear transform
cannam@167 86 closely related to the DFT. In the DFT, one multiplies each input by
cannam@167 87 <em>cos - i * sin</em> (a complex exponential), whereas in the DHT each
cannam@167 88 input is multiplied by simply <em>cos + sin</em>. Thus, the DHT
cannam@167 89 transforms <code>n</code> real numbers to <code>n</code> real numbers, and has the
cannam@167 90 convenient property of being its own inverse. In FFTW, a DHT (of any
cannam@167 91 positive <code>n</code>) can be specified by an r2r kind of <code>FFTW_DHT</code>.
cannam@167 92 <a name="index-FFTW_005fDHT"></a>
cannam@167 93 <a name="index-discrete-Hartley-transform"></a>
cannam@167 94 <a name="index-DHT"></a>
cannam@167 95 </p>
cannam@167 96 <p>Like the DFT, in FFTW the DHT is unnormalized, so computing a DHT of
cannam@167 97 size <code>n</code> followed by another DHT of the same size will result in
cannam@167 98 the original array multiplied by <code>n</code>.
cannam@167 99 <a name="index-normalization-4"></a>
cannam@167 100 </p>
cannam@167 101 <p>The DHT was originally proposed as a more efficient alternative to the
cannam@167 102 DFT for real data, but it was subsequently shown that a specialized DFT
cannam@167 103 (such as FFTW&rsquo;s r2hc or r2c transforms) could be just as fast. In FFTW,
cannam@167 104 the DHT is actually computed by post-processing an r2hc transform, so
cannam@167 105 there is ordinarily no reason to prefer it from a performance
cannam@167 106 perspective.<a name="DOCF5" href="#FOOT5"><sup>5</sup></a>
cannam@167 107 However, we have heard rumors that the DHT might be the most appropriate
cannam@167 108 transform in its own right for certain applications, and we would be
cannam@167 109 very interested to hear from anyone who finds it useful.
cannam@167 110 </p>
cannam@167 111 <p>If <code>FFTW_DHT</code> is specified for multiple dimensions of a
cannam@167 112 multi-dimensional transform, FFTW computes the separable product of 1d
cannam@167 113 DHTs along each dimension. Unfortunately, this is not quite the same
cannam@167 114 thing as a true multi-dimensional DHT; you can compute the latter, if
cannam@167 115 necessary, with at most <code>rank-1</code> post-processing passes
cannam@167 116 [see e.g. H. Hao and R. N. Bracewell, <i>Proc. IEEE</i> <b>75</b>, 264&ndash;266 (1987)].
cannam@167 117 </p>
cannam@167 118 <p>For the precise mathematical definition of the DHT as used by FFTW, see
cannam@167 119 <a href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes">What FFTW Really Computes</a>.
cannam@167 120 </p>
cannam@167 121 <div class="footnote">
cannam@167 122 <hr>
cannam@167 123 <h4 class="footnotes-heading">Footnotes</h4>
cannam@167 124
cannam@167 125 <h3><a name="FOOT5" href="#DOCF5">(5)</a></h3>
cannam@167 126 <p>We provide the DHT mainly as a byproduct of some
cannam@167 127 internal algorithms. FFTW computes a real input/output DFT of
cannam@167 128 <em>prime</em> size by re-expressing it as a DHT plus post/pre-processing
cannam@167 129 and then using Rader&rsquo;s prime-DFT algorithm adapted to the DHT.</p>
cannam@167 130 </div>
cannam@167 131 <hr>
cannam@167 132 <div class="header">
cannam@167 133 <p>
cannam@167 134 Previous: <a href="Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029.html#Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029" accesskey="p" rel="prev">Real even/odd DFTs (cosine/sine transforms)</a>, Up: <a href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data" accesskey="u" rel="up">More DFTs of Real Data</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>
cannam@167 135 </div>
cannam@167 136
cannam@167 137
cannam@167 138
cannam@167 139 </body>
cannam@167 140 </html>