Parallel computation of the fast Fourier transform on a binary tree multiprocessor

Parallel computation of the fast Fourier transform on a binary tree multiprocessor

0.00 Avg rating0 Votes
Article ID: iaor1989550
Country: Japan
Volume: J72-D-I
Issue: 4
Start Page Number: 229
End Page Number: 237
Publication Date: Apr 1989
Journal: Transactions of the Institute of Electronics, Information and Communication Engineers
Authors: ,
Keywords: computers, experiment
Abstract:

The authors study here a parallel computation of the fast Fourer transform on a binary tree multiprocessor. First, parallel algorithms are developed from Norton-Silberger’s algorithm. Then the data communication method is shown to be an important factor in the parallel computation. An efficient data communication method is presented. Finally, the parallel computation is implemented on a binary tree machine CORAL68K. The performance results and evaluation are shown. [In Japanese.]

Reviews

Required fields are marked *. Your email address will not be published.