Inscriere cercetatori

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa old.ad-astra.ro

Facebook

Parallel algorithms for Fast Fourier transformation using PowerList, ParList and PList theories

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în revistã ştiinţificã

Autori: Niculescu Virginia

Editorial: Spinger-Verlag, EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS. LECTURE NOTES IN COMPUTER SCIENCE, 2400, p.400-403, 2002.

Rezumat:

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.

Cuvinte cheie: parallel computation, fft