Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: FFTW 3.3.5: 1d Discrete Hartley Transforms (DHTs) Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: Chris@42:
Chris@42:

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

Chris@42:
Chris@42:
Chris@42: Chris@42:

4.8.5 1d Discrete Hartley Transforms (DHTs)

Chris@42: Chris@42: Chris@42: Chris@42:

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

.

Chris@42: Chris@42:

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

Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: