{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:53:42Z","timestamp":1784775222604,"version":"3.55.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/msp.2014.2329131","type":"journal-article","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T19:58:57Z","timestamp":1408391937000},"page":"91-100","source":"Crossref","is-referenced-by-count":144,"title":["Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data"],"prefix":"10.1109","volume":"31","author":[{"given":"Anna C.","family":"Gilbert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Iwen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ludwig","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348587"},{"key":"ref11","article-title":"Near-optimal algorithm for sparse Fourier transform","author":"hassanieh","year":"0","journal-title":"Proc Ann ACM Symp Theory of Computing (STOC)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.93"},{"key":"ref13","article-title":"A sparse Prony FFT","author":"heider","year":"0","journal-title":"Proc Int Conf Sampling Theory Applicat (SAMPTA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848169"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.36"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465217"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9057-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.03.007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103466"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2012.6328424"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2535753.2535764"},{"key":"ref3","first-page":"381","article-title":"Deterministic sparse Fourier approximation via fooling arithmetic progressions","author":"akavia","year":"0","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736670"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2012.2221832"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"ref8","article-title":"Improved time bounds for near-optimal space Fourier representations","author":"gilbert","year":"0","journal-title":"Proc SPIE Conf Wavelets"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2014.6757512"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238189"},{"key":"ref20","first-page":"1102","article-title":"Randomness and non-determinism","volume":"58","author":"levin","year":"1993","journal-title":"J Symb Logic"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792239291"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536913500039"},{"key":"ref24","article-title":"Mrs sparse-fft: Reducing acquisition time and artifacts for in vivo 2D correlation spectroscopy","author":"shi","year":"0","journal-title":"Proc Int Society for Magnetic Resonance in Medicine Annu Meeting & Exhibition (ISMRM)"},{"key":"ref23","article-title":"Computing a -sparse -length discrete Fourier transform using at most samples and complexity","author":"pawar","year":"0","journal-title":"Proc IEEE Int Symp Information Theory (ISIT)"},{"key":"ref26","article-title":"A sparse sub-linear Hadamard transform","author":"scheibler","year":"0","journal-title":"Proc Allerton"},{"key":"ref25","article-title":"High performance sparse fast Fourier transform","author":"schumacher","year":"2013"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/6879573\/06879613.pdf?arnumber=6879613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:50:24Z","timestamp":1642006224000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6879613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":29,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/msp.2014.2329131","relation":{},"ISSN":["1053-5888"],"issn-type":[{"value":"1053-5888","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}