Parallel sparse FFT

IA3@SC, ArticleNo.10, 2013.

Cited by: 12|Views21
EI

Abstract:

The Fast Fourier Transform (FFT) is a widely used numerical algorithm. When N input data points lead to only k N non-zero coefficients in the transformed domain, the algorithm is clearly inefficient: the FFT performs O(NlogN) operations on N input data points in order to calculate only k non-zero or large coefficients, and N -- k zero or ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments