Computing the Two-Dimensional Fast Fourier Transform on the ASPEN Tree Machine
23 May 1989
This paper addresses the problem of computing the two-dimensional Fast Fourier Transform (2D FFT) on a tree-structed parallel computer. The 2D FFT is an important computation that appears in many applications such as radar and image processing. The real-time requirements of such applications has led to many investigations of how to accelerate its execution, in particular using parallel processing.