{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:29:19Z","timestamp":1725391759838},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/itw.2012.6404730","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T15:30:12Z","timestamp":1358436612000},"page":"527-531","source":"Crossref","is-referenced-by-count":4,"title":["Fundamental limits on power consumption for lossless signal reconstruction"],"prefix":"10.1109","author":[{"given":"Pulkit","family":"Grover","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","author":"cover","year":"1991","journal-title":"Elements of Information Theory"},{"key":"17","first-page":"1190","article-title":"Lower bounds for sparse recovery","author":"do ba","year":"2010","journal-title":"Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"15","article-title":"A vector version of witsenhausen's counterexample: Towards convergence of control, communication and computation","author":"grover","year":"2008","journal-title":"Proceedings of the 47th IEEE CDC"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.941094"},{"journal-title":"A Complexity Theory for VLSI","year":"1980","author":"thompson","key":"13"},{"key":"14","article-title":"The power cost of overdesigning codes","author":"ganesan","year":"2011","journal-title":"SIPS"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"journal-title":"ADC Performance Survey 1997-2012","year":"0","author":"murmann","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"1","article-title":"Fundamental limits on complexity of lossless signal recovery","author":"grover","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"journal-title":"Sparsity pattern recovery in compressed sensing","year":"2011","author":"reeves","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595173"},{"key":"6","article-title":"Optimizing code-decoder pairs for \"green\" code design","author":"ganesan","year":"2012","journal-title":"Proc IEEE Globecom"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284015"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110922"},{"journal-title":"Shannon theory for compressed sensing","year":"2011","author":"wu","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206047"}],"event":{"name":"2012 IEEE Information Theory Workshop (ITW 2012)","start":{"date-parts":[[2012,9,3]]},"location":"Lausanne, Switzerland","end":{"date-parts":[[2012,9,7]]}},"container-title":["2012 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389798\/6404631\/06404730.pdf?arnumber=6404730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T01:50:56Z","timestamp":1498009856000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6404730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/itw.2012.6404730","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}