Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!ginosko!uakari.primate.wisc.edu!unmvax!pprg.unm.edu!topgun.dspo.gov!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: 4 Oct 89 16:19:59 GMT References: <178@desint.UUCP> Sender: news@nmsu.edu Organization: NMSU Computer Science Lines: 26 In-reply-to: geoff@desint.UUCP's message of 4 Oct 89 04:14:48 GMT In article <178@desint.UUCP> geoff@desint.UUCP (Geoff Kuenning) writes: In article ted@nmsu.edu (Ted Dunning) writes: > see knuth. (as in all things). I wasn't aware of a discussion of FFT's in Knuth. It certainly isn't in my copies of Volumes 1 or 3. I don't have a copy of volume 2, because (despite its title) it is devoted primarily to random number generators. But I've read it (long ago) and don't recall FFT's there, either. Am I misremembering? only slightly. actually volume 2 covers a great deal more than just random number generators and their evaluation. unfortunately i was misremembering, too. fft's are mentioned obliquely in several places in volume 2 in the context of multiplication. i don't think that any of the references are really very good introductions to the fft. ooooops. -- ted@nmsu.edu remember, when extensions and subsets are outlawed, only outlaws will have extensions or subsets