Skip to main content
SpringerLink
Log in

Sparse Fourier Transform

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 106 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Ailon N (2014) An n∖log n lower bound for Fourier transform computation in the well conditioned model. CoRR. abs/1403.1307, http://arxiv.org/abs/1403.1307

  2. Candes E, Tao T (2006) Near optimal signal recovery from random projections: universal encoding strategies. IEEE Trans Info Theory

    MATH  Google Scholar 

  3. Candes E, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Info Theory 52:489–509

    Article  MathSciNet  MATH  Google Scholar 

  4. Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: ICALP

    Book  MATH  Google Scholar 

  5. Cormode G, Muthukrishnan S (2004) Improved data stream summaries: the count-min sketch and its applications. In: LATIN

    MATH  Google Scholar 

  6. Do Ba K, Indyk P, Price E, Woodruff D (2010) Lower bounds for sparse recovery. In: SODA

    MATH  Google Scholar 

  7. Donoho D (2006) Compressed sensing. IEEE Trans Info Theory 52(4):1289–1306

    Article  MathSciNet  MATH  Google Scholar 

  8. Ghazi B, Hassanieh H, Indyk P, Katabi D, Price E, Shi L (2013) Sample-optimal average-case sparse Fourier transform in two dimensions. In: Allerton

    Book  Google Scholar 

  9. Gilbert A, Guha S, Indyk P, Muthukrishnan M, Strauss M (2002) Near-optimal sparse Fourier representations via sampling. In: STOC

    Book  MATH  Google Scholar 

  10. Gilbert A, Muthukrishnan M, Strauss M (2005) Improved time bounds for near-optimal space Fourier representations. In: SPIE conference on wavelets

    Google Scholar 

  11. Gilbert AC, Li Y, Porat E, Strauss MJ (2010) Approximate sparse recovery: optimizing time and measurements. In: STOC, pp 475–484

    MATH  Google Scholar 

  12. Goldreich O, Levin L (1989) A hard-corepredicate for allone-way functions. In: STOC, pp 25–32

    Google Scholar 

  13. Hassanieh H, Indyk P, Katabi D, Price E (2012) Nearly optimal sparse Fourier transform. In: STOC

    Book  MATH  Google Scholar 

  14. Indyk P, Kapralov M (2014) Sample-optimal Fourier sampling in any constant dimension. In: 2014 IEEE 55th annual symposium on foundations of computer science (FOCS). IEEE, pp 514–523

    Google Scholar 

  15. Indyk P, Price E, Woodruff D (2011) On the power of adaptivity in sparse recovery. In: FOCS

    Book  MATH  Google Scholar 

  16. Iwen MA (2010) Combinatorial sublinear-time Fourier algorithms. Found Comput Math 10:303–338

    Article  MathSciNet  MATH  Google Scholar 

  17. Kushilevitz E, Mansour Y (1991) Learning decision trees using the Fourier spectrum. In: STOC

    Book  MATH  Google Scholar 

  18. Levin L (1993) Randomness and non-determinism. J Symb Logic 58(3):1102–1103

    Google Scholar 

  19. Mansour Y (1992) Randomized interpolation and approximation of sparse polynomials. In: ICALP

    MATH  Google Scholar 

  20. Morgenstern J (1973) Note on a lower bound on the linear complexity of the fast Fourier transform. J ACM (JACM) 20(2):305–306

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Texas, Austin, TX, USA

    Eric Price

Authors
  1. Eric Price
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eric Price .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Price, E. (2016). Sparse Fourier Transform. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_800

Download citation

Publish with us

Policies and ethics

Search

Navigation