Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!cmcl2!lanl!opus!ted
From: ted@nmsu.edu (Ted Dunning)
Newsgroups: comp.dsp
Subject: Re: FFT / FHT (was Re: Adjust-Speed CD player?)
Message-ID: 
Date: 29 Sep 89 21:08:37 GMT
References: <698@lakart.UUCP> <4755@orca.WV.TEK.COM>
Sender: news@nmsu.edu
Organization: NMSU Computer Science
Lines: 17
In-reply-to: mhorne@ka7axd.wv.tek.com's message of 29 Sep 89 08:33:22 GMT


In article <4755@orca.WV.TEK.COM> mhorne@ka7axd.wv.tek.com (Michael T.Horne) writes:

	...
   However, there are techniques available for reducing the
   computation time for a normal FFT down to that of the FHT, such as
   (for real data sets) transforming two data sets of size N using a
   single N-point FFT, transforming a data set of size N using an
   N/2-point FFT, etc.  In short, FFT techniques are available that
   minimize the purported computation-time advantage of the FHT.

see knuth.  (as in all things).

--
ted@nmsu.edu
			remember, when extensions and subsets are outlawed,
			only outlaws will have extensions or subsets