Name
Abstract | ||
|---|---|---|
This paper analyzes the performance of the execution of a few commonly used versions of the Fast Fourier Transform (FFT) algorithm. We started from the C implementation of programs implementing the aforementioned FFT algorithms, then profiled their execution on a series of multicore platforms, both embedded and not. The aim of this work is multiple: in the first place we tried to find out how well different FFT algorithms map to different multicore processors. Secondly, we wanted to understand also how well the performance scales with the number of cores, and how well current compilers manage in exploiting the available hardware when compared to handcrafted programs. Results show that Radix-4 Cooley-Tuckey FFT is on average the best one among the algorithms considered. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISSOC.2010.5625561 | System Chip |
Keywords | DocType | ISBN |
fast fourier transforms,mathematics computing,multiprocessing systems,program compilers,c implementation,radix-4 cooley-tuckey fast fourier transform,compilers,multicore processor,multicore processors,benchmark testing,multicore processing,fast fourier transform,system on a chip | Conference | 978-1-4244-8279-5 |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brunelli, C. | 1 | 1 | 0.39 |
| Airoldi, R. | 2 | 12 | 1.38 |
| Nurmi, J. | 3 | 1 | 0.39 |