Journal article Open Access

Compressed sensing with approximate message passing using in-memory computing

Le Gallo, Manuel; Sebastian, Abu; Cherubini, Giovanni; Giefers, Heiner; Eleftheriou, Evangelos


DCAT Export

<?xml version='1.0' encoding='utf-8'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#">
  <rdf:Description rdf:about="https://zenodo.org/record/3249877">
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/3249877</dct:identifier>
    <foaf:page rdf:resource="https://zenodo.org/record/3249877"/>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Le Gallo, Manuel</foaf:name>
        <foaf:givenName>Manuel</foaf:givenName>
        <foaf:familyName>Le Gallo</foaf:familyName>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>IBM Research - Zurich, 8803 Rüschlikon, Switzerland</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Sebastian, Abu</foaf:name>
        <foaf:givenName>Abu</foaf:givenName>
        <foaf:familyName>Sebastian</foaf:familyName>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>IBM Research - Zurich, 8803 Rüschlikon, Switzerland</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Cherubini, Giovanni</foaf:name>
        <foaf:givenName>Giovanni</foaf:givenName>
        <foaf:familyName>Cherubini</foaf:familyName>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>IBM Research - Zurich, 8803 Rüschlikon, Switzerland</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Giefers, Heiner</foaf:name>
        <foaf:givenName>Heiner</foaf:givenName>
        <foaf:familyName>Giefers</foaf:familyName>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Eleftheriou, Evangelos</foaf:name>
        <foaf:givenName>Evangelos</foaf:givenName>
        <foaf:familyName>Eleftheriou</foaf:familyName>
      </rdf:Description>
    </dct:creator>
    <dct:title>Compressed sensing with approximate message passing using in-memory computing</dct:title>
    <dct:publisher>
      <foaf:Agent>
        <foaf:name>Zenodo</foaf:name>
      </foaf:Agent>
    </dct:publisher>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2018</dct:issued>
    <dcat:keyword>Approximate message passing</dcat:keyword>
    <dcat:keyword>Compressed sensing</dcat:keyword>
    <dcat:keyword>In-memory computing</dcat:keyword>
    <dcat:keyword>Phase-change memory</dcat:keyword>
    <frapo:isFundedBy rdf:resource="info:eu-repo/grantAgreement/EC/H2020/682675/"/>
    <schema:funder>
      <foaf:Organization>
        <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/100010661</dct:identifier>
        <foaf:name>European Commission</foaf:name>
      </foaf:Organization>
    </schema:funder>
    <frapo:isFundedBy rdf:resource="info:eu-repo/grantAgreement/EC/H2020/780215/"/>
    <schema:funder>
      <foaf:Organization>
        <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/100010661</dct:identifier>
        <foaf:name>European Commission</foaf:name>
      </foaf:Organization>
    </schema:funder>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2018-08-29</dct:issued>
    <owl:sameAs rdf:resource="https://zenodo.org/record/3249877"/>
    <adms:identifier>
      <adms:Identifier>
        <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/3249877</skos:notation>
        <adms:schemeAgency>url</adms:schemeAgency>
      </adms:Identifier>
    </adms:identifier>
    <owl:sameAs rdf:resource="https://doi.org/10.1109/TED.2018.2865352"/>
    <dct:description>&lt;p&gt;In-memory computing is a promising non-von Neumann approach where certain computational tasks are performed within resistive memory units by exploiting their physical attributes. In this paper, we propose a new method for fast and robust compressed sensing of sparse signals with approximate message passing recovery using in-memory computing. The measurement matrix for compressed sensing is encoded in the conductance states of resistive memory devices organized in a crossbar array. This way, the matrix-vector multiplications associated with both the compression and recovery tasks can be performed by the same crossbar array without intermediate data movements at potential O(1) time complexity. For a signal of size N, the proposed method achieves a potential O(N)-fold recovery complexity reduction compared with a standard software approach. We show the array-level robustness of the scheme through large-scale experimental demonstrations using more than 256k phase-change memory devices.&lt;/p&gt;</dct:description>
    <dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/>
    <dct:accessRights>
      <dct:RightsStatement rdf:about="info:eu-repo/semantics/openAccess">
        <rdfs:label>Open Access</rdfs:label>
      </dct:RightsStatement>
    </dct:accessRights>
    <dct:license rdf:resource="https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"/>
    <dcat:distribution>
      <dcat:Distribution>
        <dcat:accessURL rdf:resource="https://doi.org/10.1109/TED.2018.2865352"/>
        <dcat:byteSize>586406</dcat:byteSize>
        <dcat:downloadURL rdf:resource="https://zenodo.org/record/3249877/files/LeGallo18.pdf"/>
        <dcat:mediaType>application/pdf</dcat:mediaType>
      </dcat:Distribution>
    </dcat:distribution>
  </rdf:Description>
  <foaf:Project rdf:about="info:eu-repo/grantAgreement/EC/H2020/682675/">
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">682675</dct:identifier>
    <dct:title>PROJECTED MEMRISTOR: A nanoscale device for cognitive computing</dct:title>
    <frapo:isAwardedBy>
      <foaf:Organization>
        <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/100010661</dct:identifier>
        <foaf:name>European Commission</foaf:name>
      </foaf:Organization>
    </frapo:isAwardedBy>
  </foaf:Project>
  <foaf:Project rdf:about="info:eu-repo/grantAgreement/EC/H2020/780215/">
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">780215</dct:identifier>
    <dct:title>Computation-in-memory architecture based on resistive devices</dct:title>
    <frapo:isAwardedBy>
      <foaf:Organization>
        <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/100010661</dct:identifier>
        <foaf:name>European Commission</foaf:name>
      </foaf:Organization>
    </frapo:isAwardedBy>
  </foaf:Project>
</rdf:RDF>
84
126
views
downloads
Views 84
Downloads 126
Data volume 73.9 MB
Unique views 83
Unique downloads 125

Share

Cite as