Skip to main navigation Skip to search Skip to main content

CusFFT: A High-Performance Sparse Fast Fourier Transform Algorithm on GPUs

  • Cheng Wang
  • , Sunita Chandrasekaran
  • , Barbara Chapman
  • University of Houston
  • University of Delaware

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Scopus citations

Abstract

The Fast Fourier Transform (FFT) is one of the most important numerical tools widely used in many scientific and engineering applications. The algorithm performs O(nlogn) operations on n input data points in order to calculate only small number of k large coefficients, while the rest of n - k numbers are zero or negligibly small. The algorithm is clearly inefficient, when n points input data lead to only k.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages963-972
Number of pages10
ISBN (Electronic)9781509021406
DOIs
StatePublished - Jul 18 2016
Event30th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016 - Chicago, United States
Duration: May 23 2016May 27 2016

Publication series

NameProceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016

Conference

Conference30th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016
Country/TerritoryUnited States
CityChicago
Period05/23/1605/27/16

Keywords

  • CUDA
  • Fourier Transforms
  • GPGPU
  • Numerical algorithms

Fingerprint

Dive into the research topics of 'CusFFT: A High-Performance Sparse Fast Fourier Transform Algorithm on GPUs'. Together they form a unique fingerprint.

Cite this