Time-data trade-off in the sparse Fourier transform

No abstract is available for this paper.

• Publication year

  2017

• Venue

  European Signal Processing Conference

• Publication date

  2017-08-01

• Fields of study

  Mathematics, Physics, Computer Science, Engineering

• Identifiers
  DOI 10.23919/EUSIPCO.2017.8081583
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sub-linear time compressed sensing using sparse-graph codes

  2015influential reference
• Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data

  2014cited by this paper
• Sparse Fast Fourier Transform by downsampling

  2013cited by this paper
• Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity

  2013influential reference
• Sample-optimal average-case sparse Fourier Transform in two dimensions

  2013cited by this paper
• PULSE: Peeling-based Ultra-Low complexity algorithms for Sparse signal Estimation

  2013cited by this paper
• Nearly optimal sparse fourier transform

  2012cited by this paper
• Proceedings of the forty-fourth annual ACM symposium on Theory of computing

  2012cited by this paper
• A Tutorial on Fast Fourier Sampling

  2008cited by this paper
• Near-optimal sparse fourier representations via sampling

  2002cited by this paper
• Spectrum-blind minimum-rate sampling and reconstruction of multiband signals

  1996cited by this paper

• No citing papers are available for this paper.