Analysis and processing of very large data sets, or big data, poses a significant challenge.
Massive data sets are collected and studied in numerous domains, from engineering …

Recent advances in computing have led to an explosion in the amount of data being
generated. Processing the ever-growing data in a timely manner has made throughput …

One embodiment of the invention includes a method for generating a SIMD data structure
tailored for processing fast Fourier transforms (FFTS) on a SIMD multi-core processor …

In this paper, we address the question of how to automatically map computational kernels to
highly efficient code for a wide range of computing platforms and establish the correctness of …

Current graphics processing units (GPUs) are massively parallel computing environments
offering remarkable performance boosts in parallelizable tasks. Audio signal processing is a …

Fast Fourier Transform (FFT) is an essential algorithm for numerous scientific and
engineering applications. It is key to implement FFT in a high-performance and energy …

The bulk synchronous parallel (BSP) model, as well as parallel programming interfaces
based on BSP, classically target distributed-memory parallel architectures. In earlier work …

The sparse fast Fourier transform (SFFT) is a recent novel algorithm to compute discrete
Fourier transforms on signals with a sparse frequency domain with an improved asymptotic …