.Chris@19: Next: Multi-dimensional Transforms, Chris@19: Previous: 1d Real-odd DFTs (DSTs), Chris@19: Up: What FFTW Really Computes Chris@19:
The discrete Hartley transform (DHT) of a 1d real array X of size Chris@19: n computes a real array Y of the same size, where: Chris@19:
.FFTW computes an unnormalized transform, in that there is no coefficient Chris@19: in front of the summation in the DHT. In other words, applying the Chris@19: transform twice (the DHT is its own inverse) will multiply the input by Chris@19: n. Chris@19: Chris@19: Chris@19: Chris@19: