Fetching the paper…
Reading the bibliography…
Fourier transformation is an extensively studied problem in many research fields.
I. I. Rabi, J. R. Zacharias, S. Millman, and P. Kusch, “A new method of measuring nuclear magnetic moment,” Physical review , vol. 53, no. 4, p. 318, 1938
1938
Earlier work this paper cites.
J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Mathematics of computation , vol. 19, no. 90, pp. 297–301, 1965
1965
Earlier work this paper cites.
P. R. Griffiths, “Fourier transform infrared spectrometry,” Science , vol. 222, no. 4621, pp. 297–302, 1983
1983
Earlier work this paper cites.
G. O. Reynolds, The New Physical Optics Notebook: Tutorials in Fourier Optics. ERIC, 1989
1989
Earlier work this paper cites.
C. D. McGillem and G. R. Cooper, Continuous and discrete signal and system analysis . Harcourt School, 1991
1991
Earlier work this paper cites.
1991
Earlier work this paper cites.
D. I. Hoult and B. Bhakar, “Nmr signal reception: Virtual photons and coherent spontaneous emission,” Concepts in Magnetic Resonance: An Educational Journal , vol. 9, no. 5, pp. 277–297, 1997
1997
Earlier work this paper cites.
F. G. Friedlander, M. S. Joshi, M. Joshi, and M. C. Joshi, Introduction to the Theory of Distributions . Cambridge University Press, 1998
1998
Earlier work this paper cites.
J. G. Proakis, Digital signal processing: principles algorithms and applications . Pearson Education India, 2001
2001
Earlier work this paper cites.
A. C. Gilbert, S. Muthukrishnan, and M. Strauss, “Improved time bounds for near-optimal sparse Fourier representations,” in Optics & Photonics 2005 . International Society for Optics and Photonics, 2005, pp. 59 141A–59 141A
2005
Earlier work this paper cites.
E. J. Candes, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on pure and applied mathematics , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Earlier work this paper cites.
A. M. Aibinu, M.-J. E. Salami, A. A. Shafie, and A. R. Najeeb, “Mri reconstruction using discrete fourier transform: a tutorial,” 2008
2008
Earlier work this paper cites.
M. Rudelson and R. Vershynin, “On sparse reconstruction from fourier and gaussian measurements,” Communications on Pure and Applied Mathematics , vol. 61, no. 8, pp. 1025–1045, 2008
2008
Cited alongside, same era.
P. J. Schreier and L. L. Scharf, Statistical signal processing of complex-valued data: the theory of improper and noncircular signals . Cambridge university press, 2010
2010
Cited alongside, same era.
D. G. Voelz, Computational fourier optics: a MATLAB tutorial . SPIE press Bellingham, Washington, 2011
2011
Cited alongside, same era.
E. Price, “Efficient sketches for the set query problem,” in Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms . Society for Industrial and Applied Mathematics, 2011, pp. 41–56
2011
Cited alongside, same era.
H. Hassanieh, P. Indyk, D. Katabi, and E. Price, “Nearly optimal sparse fourier transform,” in Proceedings of the forty-fourth annual ACM symposium on Theory of computing . ACM, 2012, pp. 563–578
P. Indyk and M. Kapralov, “Sample-optimal fourier sampling in any constant dimension,” in Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on . IEEE, 2014, pp. 514–523
2014
Later among the works it cites.
J. Bourgain, “An improved estimate in the restricted isometry problem,” in Geometric Aspects of Functional Analysis . Springer, 2014, pp. 65–70
2014
Later among the works it cites.
B. Boashash, Time-frequency signal analysis and processing: a comprehensive reference . Academic press, 2015
2015
Later among the works it cites.
E. Price and Z. Song, “A robust sparse Fourier transform in the continuous setting,” in Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on . IEEE, 2015, pp. 583–600
2015
Later among the works it cites.
M. Kapralov, “Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time,” in Symposium on Theory of Computing Conference, STOC’16, Cambridge, MA, USA, June 19-21, 2016 , 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
H. Hassanieh, P. Indyk, D. Katabi, and E. Price, “Simple and practical algorithm for sparse Fourier transform,” in Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms . SIAM, 2012, pp. 1183–1194
2012
Cited alongside, same era.
K. Schmidt-Rohr and H. W. Spiess, Multidimensional solid-state NMR and polymers . Elsevier, 2012
2012
Cited alongside, same era.
M. A. Iwen, “Improved approximation guarantees for sublinear-time Fourier algorithms,” Applied And Computational Harmonic Analysis , vol. 34, no. 1, pp. 57–82, 2013
2013
Cited alongside, same era.
L. Shi, O. Andronesi, H. Hassanieh, B. Ghazi, D. Katabi, and E. Adalsteinsson, “Mrs sparse-fft: Reducing acquisition time and artifacts for in vivo 2d correlation spectroscopy,” in ISMRM13, Int. Society for Magnetic Resonance in Medicine Annual Meeting and Exhibition , 2013
2013
Cited alongside, same era.
M. M. Wilde, Quantum information theory . Cambridge University Press, 2013
2013
Cited alongside, same era.
P. Indyk, M. Kapralov, and E. Price, “(Nearly) Sample-optimal sparse Fourier transform,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM, 2014, pp. 480–499
2014
Cited alongside, same era.
2016
Later among the works it cites.
X. Chen, D. M. Kane, E. Price, and Z. Song, “Fourier-sparse interpolation without a frequency gap,” in Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on . IEEE, 2016, pp. 741–750
2016
Later among the works it cites.
J. Goodman, Introduction to Fourier Optics . W. H. Freeman, 2017. [Online]. Available: https://books.google.com/books?id=9zY8DwAAQBAJ
2017
Later among the works it cites.
2017
Later among the works it cites.
V. Nakos, Z. Song, and Z. Wang, “(nearly) sample-optimal sparse fourier transform in any dimension; ripless and filterless,” in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, 2019, pp. 1568–1577
2019
Later among the works it cites.
2020
Later among the works it cites.