Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!emory!gatech!bloom-beacon!eru!hagbard!sunic!mcsun!ub4b!prlbcom!prlb24!vdongen
From: vdongen@prlb24.prlb.philips.be (vdongen)
Newsgroups: comp.dsp
Subject: Integer FFT
Keywords: FFT routine, real-time speech and image processing
Message-ID: <58@prlb24.prlb.philips.be>
Date: 6 Dec 90 15:52:24 GMT
Organization: Philips Research Laboratory Belgium
Lines: 18

******** LOOKING FOR INTEGER FFT *******************

I'm looking for extra fast implementations of FFT. We have a 256
point FFT for which we need a "dedicated routine". So cosines and 
sines are computed first and now we think that doing everything
in integer might speed up even more (it's for real-time speech
recognition and image processing). Are there any routines around
that do that. We would prefer code in C if possible. We are also
looking at radix 4 FFT, which we think will improve things.

Any pointers would help (PS we have NAG and the IEEE DSP package)

Best regards,
Paul Van Dooren			e-mail: pvandooren@prlb.philips.be
Philips Research Laboratory 
Avenue Einstein 4
B-1348 Louvain-la-Neuve, Belgium
Tel:+32 10 470658  Fax:+32 10 470699