Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: FFTW 3.3.8: 1d Discrete Hartley Transforms (DHTs) Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82:
Chris@82:

Chris@82: Next: , Previous: , Up: What FFTW Really Computes   [Contents][Index]

Chris@82:
Chris@82:
Chris@82: Chris@82:

4.8.5 1d Discrete Hartley Transforms (DHTs)

Chris@82: Chris@82: Chris@82: Chris@82:

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

.
Chris@82:

Chris@82: Chris@82:

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

Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: