{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T14:45:10Z","timestamp":1766414710106,"version":"build-2065373602"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284015","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"2716-2720","source":"Crossref","is-referenced-by-count":31,"title":["Fundamental limits on the power consumption of encoding and decoding"],"prefix":"10.1109","author":[{"given":"Pulkit","family":"Grover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anant","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Digital Integrated Circuits","year":"2002","author":"rabaey","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313073"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110922"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120330"},{"journal-title":"A General Lower Bound on the VLSI Decoding Complexity","year":"2012","author":"sahai","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2009.2032584"},{"key":"2","first-page":"1","article-title":"Energy Constrained Modulation Optimization","volume":"4","author":"cui","year":"2005","journal-title":"IEEE Trans Wireless Commun"},{"key":"1","article-title":"Fundamental limits on transmission and computation power","author":"grover","year":"2012","journal-title":"ISIT'12 [Online]"},{"key":"10","article-title":"VLSI complexity of coding","author":"el gamal","year":"0","journal-title":"The MIT Conf on Adv Research in VLSI Cambridge MA Jan 1984"},{"journal-title":"A Complexity Theory for VLSI","year":"1980","author":"thompson","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"5","article-title":"Optimizing code-decoder pairs for \"green\" code design","author":"ganesan","year":"2012","journal-title":"IEEE GLOBECOM"},{"key":"4","article-title":"The power cost of overdesigning codes","author":"ganesan","year":"0","journal-title":"Proceedings of the 2011 IEEE Workshop on Signal Processing Systems (SiPS) Oct 2011"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284015.pdf?arnumber=6284015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T20:58:43Z","timestamp":1490129923000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284015\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284015","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}