{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:00:37Z","timestamp":1729616437347,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/icassp.2016.7472440","type":"proceedings-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T21:58:30Z","timestamp":1466719110000},"page":"4059-4063","source":"Crossref","is-referenced-by-count":5,"title":["Fast sparse 2-D DFT computation using sparse-graph alias codes"],"prefix":"10.1109","author":[{"given":"Frank","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameer","family":"Pawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.93"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.36"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.61"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736670"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","article-title":"The interaction algorithm and practical Fourier analysis","author":"good","year":"1958","journal-title":"Journal of the Royal Statistical Society Series B (Methodological)"},{"key":"ref15","article-title":"Using a computer to solve problems in physics","author":"thomas","year":"1963","journal-title":"Applications of Digital Computers"},{"key":"ref16","article-title":"Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes","author":"ong","year":"2015","journal-title":"arXiv preprint arXiv 1509 05849"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref6","first-page":"1","article-title":"Im-proved Time Bounds for Near-Optimal Sparse Fourier Representations","volume":"5914","author":"gilbert","year":"2005","journal-title":"Optics and Photonics 2005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"ref2","article-title":"A robust sub-linear time R-FFAST algorithm for computing a sparse DFT","author":"pawar","year":"2015","journal-title":"arXiv preprint arXiv 1501 00320"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620269"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"}],"event":{"name":"2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2016,3,20]]},"location":"Shanghai","end":{"date-parts":[[2016,3,25]]}},"container-title":["2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7465907\/7471614\/07472440.pdf?arnumber=7472440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:11:15Z","timestamp":1568074275000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7472440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icassp.2016.7472440","relation":{},"subject":[],"published":{"date-parts":[[2016,3]]}}}