cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: FFTW 3.3.5: 1d Discrete Hartley Transforms (DHTs) cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127:
cannam@127:

cannam@127: Next: , Previous: , Up: What FFTW Really Computes   [Contents][Index]

cannam@127:
cannam@127:
cannam@127: cannam@127:

4.8.5 1d Discrete Hartley Transforms (DHTs)

cannam@127: cannam@127: cannam@127: cannam@127:

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

.

cannam@127: cannam@127:

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

cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: