{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:51:37Z","timestamp":1753602697224},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875154","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"source":"Crossref","is-referenced-by-count":8,"title":["A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes"],"prefix":"10.1109","author":[{"given":"Sameer","family":"Pawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","author":"pawar","year":"2013","journal-title":"Pulse Peeling-based Ultra-low Complexity Algorithms for Sparse Signal Estimation"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9057-1"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736670"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.1003065"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"2","author":"pawar","year":"2014","journal-title":"A Novel Ffast Framework Based on Sparse Graph Codes and the Chinese Remainder Theorem for Estimating Signals Having a Sparse Spectrum"},{"key":"1","author":"pawar","year":"2013","journal-title":"Computing a K-sparse N-length DFT Using at Most 4k Samples and O (K Log K) Complexity"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.05.001"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/29.32276"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.1986.1143830"},{"key":"4","article-title":"Essai experimental","author":"prony","year":"1795","journal-title":"J Ecole Polytechn"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875154.pdf?arnumber=6875154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:25:26Z","timestamp":1602689126000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875154","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}