Path: utzoo!attcan!uunet!lll-winken!lll-tis!helios.ee.lbl.gov!pasteur!agate!ig!uwmcsd1!bbn!rochester!rutgers!gauss.rutgers.edu!math.rutgers.edu!grzybows
From: grzybows@math.rutgers.edu (grzybowski)
Newsgroups: comp.lsi
Subject: FFT
Keywords: and other similar transforms
Message-ID: 
Date: 8 Jul 88 12:55:36 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 5


Is there any hardware that does e.g. ~ 2000 or ~ 10000 point FFT
fast? (I mean e.g. ~2000 point FFT in 300 microseconds or ~10000 point
FFT in 20 miliseconds).
How about computing Fourier coefficients for expansions with respect
to less popular orthonormal sequences?