Concurrent FFT computing on multicore processors

J. Barhen, T. Humble, P. Mitra, N. Imam, B. Schleck, C. Kotas, M. Traweek

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

The emergence of streaming multicore processors with multi-SIMD (single-instruction multiple-data) architectures and ultra-low power operation combined with real-time compute and I/O reconfigurability opens unprecedented opportunities for executing sophisticated signal processing algorithms faster and within a much lower energy budget. Here, we present an unconventional Fast Fourier Transform (FFT) implementation scheme for the IBM Cell, named transverse vectorization. It is shown to outperform (both in terms of timing and GFLOP throughput) the fastest FFT results reported to date for the Cell in the open literature. We also provide the first results for multi-FFT implementation and application on the novel, ultra-low power Coherent Logix HyperX processor.

Original languageEnglish
Pages (from-to)29-44
Number of pages16
JournalConcurrency and Computation: Practice and Experience
Volume24
Issue number1
DOIs
StatePublished - Jan 2012

Keywords

  • FFT
  • HyperX
  • IBM cell
  • multicore processors
  • transverse vectorization

Fingerprint

Dive into the research topics of 'Concurrent FFT computing on multicore processors'. Together they form a unique fingerprint.

Cite this