Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cornell!uw-beaver!ubc-cs!alberta!calgary!ctycal!ingoldsb
From: ingoldsb@ctycal.COM (Terry Ingoldsby)
Newsgroups: comp.dsp
Subject: Re: FFT / FHT (was Re: Adjust-Speed CD player?)
Message-ID: <482@ctycal.UUCP>
Date: 2 Oct 89 18:51:15 GMT
References: <698@lakart.UUCP>
Organization: The City of Calgary, Ab
Lines: 18
Summary: Check Byte back issue

In article <698@lakart.UUCP>, dg@lakart.UUCP (David Goodenough) writes:
> Not too surprisingly, we're already talking about FFT, which logically
> has to be used in DSP. But does anyone know anything of FHT - the Fast
> Hartley Transform, which is supposed to do the same job as the FFT, but

There was a short article on the FHT in BYTE about 6 months ago (I can find
it if you are interested).  The following month a number of readers sent
letters to the editor lambasting the article.  As I recall the discussion
the FHT is faster than the FFT for REAL (vs complex) data.  There are well
known techniques for doing the same thing with an FFT and getting a similar
speed-up.



-- 
  Terry Ingoldsby                       ctycal!ingoldsb@calgary.UUCP
  Land Information Systems                           or
  The City of Calgary         ...{alberta,ubc-cs,utai}!calgary!ctycal!ingoldsb