Re: "Discrete Hartley transform" vs " Discrete Fouuier transform"

>"Steven G. Johnson" <stevenj@[EMAIL PROTECTED]
> wrote in message 
>news:06e324b4-acb6-4f80-b97b-acf4146a0429@[EMAIL PROTECTED]
>On Oct 17, 7:46 pm, "VelociChicken" <b...@[EMAIL PROTECTED]
> wrote:
>> Use Ron Mayer's algorithm from the early 1990's, the one with
selectable
>> trig tables and test it yourself. I've found that large FHT's are even 
>> more
>> of an advantage, compare maybe the best FFT and his FHT with 16384 data
>> points.
>
>I have tested it (e.g. http://www.fftw.org/speed/Pentium4-3.60GHz-icc/).
>It's about 4-5 times slower than the fastest real-data FFT these days
>(including half-a-dozen open-source real-data FFTs that beat it).
>
>Steven

Thanks.
I take it that's the Mayer FHT not the FFT tested there. Anyway, can't 
refute that, and I'll look through them again at some point. It may well 
have been the combination with my convolution code or some trig settings
on 
the other FFT's. Kinda weird though...