Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!columbia!tom.columbia.edu!yoram
From: yoram@tom.columbia.edu (Yoram Eisenstadter)
Newsgroups: net.analog
Subject: FFT algorithms
Message-ID: <2914@columbia.UUCP>
Date: Mon, 11-Aug-86 23:27:59 EDT
Article-I.D.: columbia.2914
Posted: Mon Aug 11 23:27:59 1986
Date-Received: Tue, 12-Aug-86 17:25:52 EDT
Sender: nobody@columbia.UUCP
Reply-To: yoram@cs.columbia.edu (Yoram Eisenstadter)
Followup-To: net.analog
Distribution: net
Organization: Columbia University CS Department
Lines: 24
Keywords: FFT cache
Summary: Wanted: FFT algorithms which use cache-memory efficiently.

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