cannam@95: cannam@95: cannam@95: 1d Discrete Hartley Transforms (DHTs) - FFTW 3.3.3 cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95:
cannam@95: cannam@95: cannam@95:

cannam@95: Next: , cannam@95: Previous: 1d Real-odd DFTs (DSTs), cannam@95: Up: What FFTW Really Computes cannam@95:

cannam@95:
cannam@95: cannam@95:

4.8.5 1d Discrete Hartley Transforms (DHTs)

cannam@95: cannam@95:

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

.
cannam@95: cannam@95:

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