1d Discrete Hartley Transforms (DHTs)

d@0: d@0: d@0: 1d Discrete Hartley Transforms (DHTs) - FFTW 3.2.1 d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0:

d@0:

d@0: d@0: d@0: Next: Multi-dimensional Transforms, d@0: Previous: 1d Real-odd DFTs (DSTs), d@0: Up: What FFTW Really Computes d@0:

d@0:

d@0: d@0:

4.8.5 1d Discrete Hartley Transforms (DHTs)

d@0: d@0:

The discrete Hartley transform (DHT) of a 1d real array X of size d@0: n computes a real array Y of the same size, where: d@0:

. d@0: d@0:

FFTW computes an unnormalized transform, in that there is no coefficient d@0: in front of the summation in the DHT. In other words, applying the d@0: transform twice (the DHT is its own inverse) will multiply the input by d@0: n. d@0: d@0: d@0: d@0: