|
cannam@95
|
1 <html lang="en">
|
|
cannam@95
|
2 <head>
|
|
cannam@95
|
3 <title>The Discrete Hartley Transform - FFTW 3.3.3</title>
|
|
cannam@95
|
4 <meta http-equiv="Content-Type" content="text/html">
|
|
cannam@95
|
5 <meta name="description" content="FFTW 3.3.3">
|
|
cannam@95
|
6 <meta name="generator" content="makeinfo 4.13">
|
|
cannam@95
|
7 <link title="Top" rel="start" href="index.html#Top">
|
|
cannam@95
|
8 <link rel="up" href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data" title="More DFTs of Real Data">
|
|
cannam@95
|
9 <link rel="prev" href="Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029.html#Real-even_002fodd-DFTs-_0028cosine_002fsine-transforms_0029" title="Real even/odd DFTs (cosine/sine transforms)">
|
|
cannam@95
|
10 <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
|
|
cannam@95
|
11 <!--
|
|
cannam@95
|
12 This manual is for FFTW
|
|
cannam@95
|
13 (version 3.3.3, 25 November 2012).
|
|
cannam@95
|
14
|
|
cannam@95
|
15 Copyright (C) 2003 Matteo Frigo.
|
|
cannam@95
|
16
|
|
cannam@95
|
17 Copyright (C) 2003 Massachusetts Institute of Technology.
|
|
cannam@95
|
18
|
|
cannam@95
|
19 Permission is granted to make and distribute verbatim copies of
|
|
cannam@95
|
20 this manual provided the copyright notice and this permission
|
|
cannam@95
|
21 notice are preserved on all copies.
|
|
cannam@95
|
22
|
|
cannam@95
|
23 Permission is granted to copy and distribute modified versions of
|
|
cannam@95
|
24 this manual under the conditions for verbatim copying, provided
|
|
cannam@95
|
25 that the entire resulting derived work is distributed under the
|
|
cannam@95
|
26 terms of a permission notice identical to this one.
|
|
cannam@95
|
27
|
|
cannam@95
|
28 Permission is granted to copy and distribute translations of this
|
|
cannam@95
|
29 manual into another language, under the above conditions for
|
|
cannam@95
|
30 modified versions, except that this permission notice may be
|
|
cannam@95
|
31 stated in a translation approved by the Free Software Foundation.
|
|
cannam@95
|
32 -->
|
|
cannam@95
|
33 <meta http-equiv="Content-Style-Type" content="text/css">
|
|
cannam@95
|
34 <style type="text/css"><!--
|
|
cannam@95
|
35 pre.display { font-family:inherit }
|
|
cannam@95
|
36 pre.format { font-family:inherit }
|
|
cannam@95
|
37 pre.smalldisplay { font-family:inherit; font-size:smaller }
|
|
cannam@95
|
38 pre.smallformat { font-family:inherit; font-size:smaller }
|
|
cannam@95
|
39 pre.smallexample { font-size:smaller }
|
|
cannam@95
|
40 pre.smalllisp { font-size:smaller }
|
|
cannam@95
|
41 span.sc { font-variant:small-caps }
|
|
cannam@95
|
42 span.roman { font-family:serif; font-weight:normal; }
|
|
cannam@95
|
43 span.sansserif { font-family:sans-serif; font-weight:normal; }
|
|
cannam@95
|
44 --></style>
|
|
cannam@95
|
45 </head>
|
|
cannam@95
|
46 <body>
|
|
cannam@95
|
47 <div class="node">
|
|
cannam@95
|
48 <a name="The-Discrete-Hartley-Transform"></a>
|
|
cannam@95
|
49 <p>
|
|
cannam@95
|
50 Previous: <a rel="previous" accesskey="p" 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>,
|
|
cannam@95
|
51 Up: <a rel="up" accesskey="u" href="More-DFTs-of-Real-Data.html#More-DFTs-of-Real-Data">More DFTs of Real Data</a>
|
|
cannam@95
|
52 <hr>
|
|
cannam@95
|
53 </div>
|
|
cannam@95
|
54
|
|
cannam@95
|
55 <h4 class="subsection">2.5.3 The Discrete Hartley Transform</h4>
|
|
cannam@95
|
56
|
|
cannam@95
|
57 <p>If you are planning to use the DHT because you've heard that it is
|
|
cannam@95
|
58 “faster” than the DFT (FFT), <strong>stop here</strong>. The DHT is not
|
|
cannam@95
|
59 faster than the DFT. That story is an old but enduring misconception
|
|
cannam@95
|
60 that was debunked in 1987.
|
|
cannam@95
|
61
|
|
cannam@95
|
62 <p>The discrete Hartley transform (DHT) is an invertible linear transform
|
|
cannam@95
|
63 closely related to the DFT. In the DFT, one multiplies each input by
|
|
cannam@95
|
64 cos - i * sin (a complex exponential), whereas in the DHT each
|
|
cannam@95
|
65 input is multiplied by simply cos + sin. Thus, the DHT
|
|
cannam@95
|
66 transforms <code>n</code> real numbers to <code>n</code> real numbers, and has the
|
|
cannam@95
|
67 convenient property of being its own inverse. In FFTW, a DHT (of any
|
|
cannam@95
|
68 positive <code>n</code>) can be specified by an r2r kind of <code>FFTW_DHT</code>.
|
|
cannam@95
|
69 <a name="index-FFTW_005fDHT-98"></a><a name="index-discrete-Hartley-transform-99"></a><a name="index-DHT-100"></a>
|
|
cannam@95
|
70 Like the DFT, in FFTW the DHT is unnormalized, so computing a DHT of
|
|
cannam@95
|
71 size <code>n</code> followed by another DHT of the same size will result in
|
|
cannam@95
|
72 the original array multiplied by <code>n</code>.
|
|
cannam@95
|
73 <a name="index-normalization-101"></a>
|
|
cannam@95
|
74 The DHT was originally proposed as a more efficient alternative to the
|
|
cannam@95
|
75 DFT for real data, but it was subsequently shown that a specialized DFT
|
|
cannam@95
|
76 (such as FFTW's r2hc or r2c transforms) could be just as fast. In FFTW,
|
|
cannam@95
|
77 the DHT is actually computed by post-processing an r2hc transform, so
|
|
cannam@95
|
78 there is ordinarily no reason to prefer it from a performance
|
|
cannam@95
|
79 perspective.<a rel="footnote" href="#fn-1" name="fnd-1"><sup>1</sup></a>
|
|
cannam@95
|
80 However, we have heard rumors that the DHT might be the most appropriate
|
|
cannam@95
|
81 transform in its own right for certain applications, and we would be
|
|
cannam@95
|
82 very interested to hear from anyone who finds it useful.
|
|
cannam@95
|
83
|
|
cannam@95
|
84 <p>If <code>FFTW_DHT</code> is specified for multiple dimensions of a
|
|
cannam@95
|
85 multi-dimensional transform, FFTW computes the separable product of 1d
|
|
cannam@95
|
86 DHTs along each dimension. Unfortunately, this is not quite the same
|
|
cannam@95
|
87 thing as a true multi-dimensional DHT; you can compute the latter, if
|
|
cannam@95
|
88 necessary, with at most <code>rank-1</code> post-processing passes
|
|
cannam@95
|
89 [see e.g. H. Hao and R. N. Bracewell, <i>Proc. IEEE</i> <b>75</b>, 264–266 (1987)].
|
|
cannam@95
|
90
|
|
cannam@95
|
91 <p>For the precise mathematical definition of the DHT as used by FFTW, see
|
|
cannam@95
|
92 <a href="What-FFTW-Really-Computes.html#What-FFTW-Really-Computes">What FFTW Really Computes</a>.
|
|
cannam@95
|
93
|
|
cannam@95
|
94 <div class="footnote">
|
|
cannam@95
|
95 <hr>
|
|
cannam@95
|
96 <h4>Footnotes</h4><p class="footnote"><small>[<a name="fn-1" href="#fnd-1">1</a>]</small> We provide the DHT mainly as a byproduct of some
|
|
cannam@95
|
97 internal algorithms. FFTW computes a real input/output DFT of
|
|
cannam@95
|
98 <em>prime</em> size by re-expressing it as a DHT plus post/pre-processing
|
|
cannam@95
|
99 and then using Rader's prime-DFT algorithm adapted to the DHT.</p>
|
|
cannam@95
|
100
|
|
cannam@95
|
101 <hr></div>
|
|
cannam@95
|
102
|
|
cannam@95
|
103 </body></html>
|
|
cannam@95
|
104
|
