Douglas Miles

Learn More
The fast Fourier transform (FFT) is a challenging algorithm to implement efficiently on a parallel computer. Recent algorithm advances have led to greatly improved FFT performance on parallel vector computers such as the CRA Y-2 and CRAY Y-MP. Variations on these techniques can be used to extend this improved performance to other parallel architectures. A(More)
  • 1