Parallel Algorithms for Fast Fourier Transformation Using PowerList , ParList and PList Theories (Research Note)

  • Authors:

  • Virginia Niculescu

  • Affiliations:

  • -

  • Venue:
  • Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

PowerList, ParList and PList data structures are efficient tools for functional descriptions of parallel programs that are divide & conquer in nature.The goal of this work is to develop three parallel variants for Fast Fourier Transformation using these theories. The variants are implied by the degree of the polynomial, which can be a power of two, a prime number, or a product of prime factors. The last variant includes the first two, and represents a general and efficient parallel algorithm for Fast Fourier Transformation. This general algorithm has a very good time complexity, and can be mapped on a recursive interconnection network.