Corpus ID: 218613644

A robust multi-dimensional sparse Fourier transform in the continuous setting

@article{Jin2020ARM,
  title={A robust multi-dimensional sparse Fourier transform in the continuous setting},
  author={Yaonan Jin and Daogao Liu and Zhao Song},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.06156}
}
  • Yaonan Jin, Daogao Liu, Zhao Song
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • Sparse Fourier transform (Sparse FT) is the problem of learning an unknown signal, whose frequency spectrum is dominated by a small amount of $k$ individual frequencies, through fast algorithms that use as few samples as possible in the time domain. The last two decades have seen an extensive study on such problems, either in the one-/multi-dimensional discrete setting [Hassanieh, Indyk, Katabi, and Price STOC'12; Kapralov STOC'16] or in the one-dimensional continuous setting [Price and Song… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 59 REFERENCES

    A Robust Sparse Fourier Transform in the Continuous Setting

    • Eric Price, Zhao Song
    • Computer Science, Mathematics
    • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
    • 2015

    Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average

    • Mikhail Kapralov
    • Computer Science, Mathematics
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017

    (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless

    Fourier-Sparse Interpolation without a Frequency Gap