R.A. Na'mneh

  • Citations Per Year
Learn More
Computing the 1-D fast Fourier transform (FFT) using the conventional six-step FFT on parallel computers requires intensive all-to-all communication due to the necessity of transposing an array three times. This all-to-all communication significantly reduces the performance of FFT in parallel systems. In this paper, we present a two-step parallel algorithm(More)
  • 1