z-logo
open-access-imgOpen Access
Calculating Fast Fourier Transform by using parallel software design patterns
Author(s) -
Robbie Vincke,
Sille Van Landschoot,
Piet Cordemans,
Joan Peuteman,
Eric Steegmans,
Jeroen Boydens
Publication year - 2012
Publication title -
lirias (ku leuven)
Language(s) - English
DOI - 10.13140/rg.2.2.11694.51522
Subject(s) - computer science , parallel computing , multi core processor , scaling , thread (computing) , fourier transform , software , parallelism (grammar) , fast fourier transform , task parallelism , algorithm , computational science , mathematics , programming language , mathematical analysis , geometry
Multicore embedded systems introduce new opportunities and challenges. Scaling of computational power is one of the main reasons for a transition to a multicore environment. Parallel design patterns, such as Map Reduce, Task Graph, Thread Pool, Task Parallelism assist to derive a parallel approach for calculating the Fast Fourier Transform. By combining these design patterns, a robust application can be obtained. The key issues for concurrent calculation of a Fast Fourier Transform are determined at a higher level avoiding low-level patch-ups.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom