Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!samsung!emory!hubcap!marcoz
From: marcoz@enquirer.scandal.cs.cmu.edu (Marco Zagha)
Newsgroups: comp.parallel
Subject: Re: 2-D FFT on Hypercube Computers
Keywords: Hypercube Multicomputers, Parallel 2-D FFT Algorithms
Message-ID: <12137@hubcap.clemson.edu>
Date: 7 Dec 90 20:39:01 GMT
Sender: fpst@hubcap.clemson.edu
Organization: Carnegie-Mellon University, CS/RI
Lines: 19
Approved: parallel@hubcap.clemson.edu



In article <12121@hubcap.clemson.edu>, rli@tybalt.caltech.edu (Rongsheng Li) writes:
>    I am seeking 2-D FFT algorithms on the Hypercube multicomputers. I didn't
> find it in any  literatures. Could anyone offer me some information on this?
> Or show me some references if you know about this. Thank you in advance.

S. Lennart Johnsson, Robert L. Krawitz, Douglas MacDonald, and
Roger Frye. "Radix-2 FFT on the Connection Machine." Technical Report NA89-2, 
Thinking Machines Corp.

S. Lennart Johnsson, Ching-Tien Ho, Michel Jacquemin, and Alan Ruttenberg.
"Computing fast Fourier transforms on Boolean cubes and related networks."
In "Advanced Algorithms and Architectures for Signal Processing II", pages
223--231, Society of Photo-Optical Instrumentation Engineers, 1987.

== Marco Zagha
Internet: marcoz@cs.cmu.edu            Uucp:   ...!seismo!cs.cmu.edu!marcoz  
Bitnet:   marcoz%cs.cmu.edu@cmuccvma   CSnet:  marcoz%cs.cmu.edu@relay.cs.net