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