Implementation of a Fast Fourier Transform Algorithm onto a Manycore Processor

Julien Hascoet (1, 2) , Jean-Francois Nezan (1) , Andrew Ensor (3) , Benoit Dupont de Dinechin (2)

1 IETR - Institut d'Électronique et des Technologies du numéRique
2 Kalray
3 AUT - Auckland University of Technology

The Fourier transform is the main processing step applied to data collected from the Square Kilometre Array (SKA) receivers. The requirement is to compute a Fourier transform of 2 19 real byte samples in real-time, while minimizing the power consumption. We address this challenge by optimizing a FFT implementation for execution on the Kalray MPPA manycore processor. Although this processor delivers high floating-point performances, we use fixed-point number representations in order to reduce the memory consumption and the I/O bandwidth. The result is an execution time of 1,07ms per FFT, including data transfers. This enables to use only two first-generation MPPA chips per flow of data coming from the receivers, for a total power consumption of 17.4W.

Mots clés: Square Kilometer Array (SKA); Fast Fourier Trans-form (FFT); Parallel Programming; Many-Core Processor; Fixed-Point Arithmetic; Network-On-Chip

Domaines: Multimédia [cs.MM]

Julien Hascoet, Jean-Francois Nezan, Andrew Ensor, Benoit Dupont de Dinechin. Implementation of a Fast Fourier Transform Algorithm onto a Manycore Processor. Conference on Design and Architectures for Signal and Image Processing (DASIP), Sep 2015, Cracow, Poland. ⟨10.1109/dasip.2015.7367270⟩. ⟨hal-01238833⟩