Overlapped Four-Step FFT Computation

  • Authors:

  • Herbert Karner;Christoph W. Ueberhuber

  • Affiliations:

  • -;-

  • Venue:
  • ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a new approach is presented in order to overlap all communication intensive steps appearing in the four-step FFT algorithm--initial data distribution, matrix transpose, and final data collection--with computation. The presented method is based on a Kronecker product factorization of the four-step FFT algorithm.