Why isn't the Hartley Transform more widely used?

I was doing a bit of research on FFT and I came across this paper. According to it, computing the Fourier Transform using FHT is significantly faster than other methods, even for complex data. Yet, from what I gathered so far, the FHT method is rarely used. Why is that?

• Paper is from 1997 - maybe there have been other developments in the 20 years since ? – Paul R Jun 14 '17 at 16:11
• "the DHT was originally proposed by R. N. Bracewell in 1983 as a more efficient computational tool in the common case where the data are purely real. It was subsequently argued, however, that specialized FFT algorithms for real inputs or outputs can ordinarily be found with slightly fewer operations than any corresponding algorithm for the DHT (see below)." – endolith Jun 14 '17 at 18:11
• Against FFTW or CUDA FFT would be a more topical comparison – Stanley Pawlukiewicz Jun 14 '17 at 21:46

The data representation is nicer if you want to work with only the non-redundant elements of a transform of purely real-valued original data (packing the real-valued $f_0$ and $f_{N/2}$ into one complex data element is ugly when storing non-redundant FFT data). Indeed, considering the Hartley transform as a dual storage representation of FFT (basically even for complex original data, $H(k) = \frac12 (F(k)+F^*(-k))$ if I remember correctly) at each stage of computation is one of the more straightforward ways to figure out a DHT step by step.