Concurrent FFT computing on multicore processors

Abstract

SUMMARYThe 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.

Guest Editor's Introduction: Special Section on Challenges and Solutions in Multicore and Many‐Core Computing

“…Barhen et al . present an unconventional fast Fourier transform implementation scheme for the IBM Cell B.E. processors, named transverse vectorization, and provide the first results for multifast Fourier transform implementation and application on the novel, ultralow power Coherent LogixHyperX processor.…”