{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:21:10Z","timestamp":1761294070465,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/tvlsi.2020.2967477","type":"journal-article","created":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T23:39:04Z","timestamp":1580945944000},"page":"1283-1291","source":"Crossref","is-referenced-by-count":4,"title":["Low-Complexity Interval Passing Algorithm and VLSI Architecture for Binary Compressed Sensing"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8457-2214","authenticated-orcid":false,"given":"Shantharam","family":"Kalipatnapu","sequence":"first","affiliation":[]},{"given":"Indrajit","family":"Chakrabarti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2013.6504167"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2017.2648854"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865712"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2012.6271921"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2019.2909754"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2012.6463559"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2358716"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513358"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2012.2218512"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394826"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181819"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2116014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.E96.B.685"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5496089"},{"key":"ref18","first-page":"1593","article-title":"Recovery thresholds for \n$\\ell_{1}$\n optimization in binary compressed sensing","author":"stojnic","year":"2010","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.24"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2008.925402"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2386300"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2018.2803627"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"article-title":"Compressed sensing reconstruction via belief propagation","year":"2006","author":"sarvotham","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205667"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2010.60"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201344"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2012.6415872"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2093698.2093844"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"2019","author":"mackay","key":"ref26"},{"key":"ref25","article-title":"A class of group-sturctured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/92\/9078135\/08984332.pdf?arnumber=8984332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:25Z","timestamp":1651070425000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8984332\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":36,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2020.2967477","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"type":"print","value":"1063-8210"},{"type":"electronic","value":"1557-9999"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}