Sciweavers

8 search results - page 1 / 2
» Small Discrete Fourier Transforms on GPUs
Sort
View
CCGRID
2011
IEEE
12 years 6 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
IEEECIT
2010
IEEE
13 years 17 days ago
Memory Saving Discrete Fourier Transform on GPUs
This paper will show an alternative method to compute the two-dimensional Discrete Fourier Transform. While current GPU Fourier transform libraries need a large buffer for storing ...
Daniel Kauker, Harald Sanftmann, Steffen Frey, Tho...
CISS
2008
IEEE
13 years 9 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
IAJIT
2010
147views more  IAJIT 2010»
12 years 12 months ago
A novel radon-wavelet based OFDM system design and performance under different channel conditions
: Finite Radon Transform mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energ...
Abbas Hasan Kattoush
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 3 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani