yoram@tom.columbia.edu (Yoram Eisenstadter) (08/12/86)
eat thi>@@- Hi.. A friend of mine has to do some signal processing on a small computer, and is interested in efficient algorithms for FFTs. In particular, does anybody know of an FFT algorithm which tries to make efficient use of cache memory (i.e. an algorithm with good locality of data reference). I guess that FFT algorithms optimized for demand-paged environments would also be relevant. Any references or other information would be appreciated. Please reply directly to me; I'll send a summary to anybody who asks for one. Many thanks..Yoram Arpanet: yoram@cs.columbia.edu Usenet: seismo!columbia!cs!yoram BITnet: yoram%cs.columbia.edu@WISCVM ARPAnet : yoram@cs.columbia.edu Usenet : seismo!columbia!cs!yoram