Computational frameworks for the fast Fourier transform
Computational frameworks for the fast Fourier transform
Introduction to the cell multiprocessor
IBM Journal of Research and Development - POWER5 and packaging
Implementation and Evaluation of Parallel FFT Using SIMD Instructions on Multi-core Processors
IWIA '07 Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems
QR factorization for the Cell Broadband Engine
Scientific Programming - High Performance Computing with the Cell Broadband Engine
Computing discrete transforms on the Cell Broadband Engine
Parallel Computing
Computer generation of fast fourier transforms for the cell broadband engine
Proceedings of the 23rd international conference on Supercomputing
FFT algorithms for vector computers
Parallel Computing
| Hi-index | 0.00 |
The emergence of streaming multicore processors with multi-SIMD 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 FFT implementation scheme for the IBM Cell, named transverse vectorization. It is shown to outperform (both in terms of timing or GFLOP throughput) the fastest FFT results reported to date in the open literature.