Computation Of Boolean Matrix Chain Products In 3D Reram

Abstract

Energy concerns, the infamous memory wall, and the enormous data deluge of the current big-data age have made the integration of processing and memory elements into a very appealing paradigm. In this paper, we focus on a computation-in-memory solution to the problem of multiplying a set of Boolean matrices, also known as Boolean matrix chain multiplication (BMCM). This is a fundamental computational task with applications in graph theory, group testing, data compression, and digital signal processing. In particular, we propose a framework for mapping arbitrary instances of BMCM to a 3-dimensional (3D) crossbar memory architecture consisting of 1-diode 1-resistor (1D1R) structures.

Publication Date

9-25-2017

Publication Title

Proceedings - IEEE International Symposium on Circuits and Systems

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/ISCAS.2017.8050962

Socpus ID

85032697188 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85032697188

This document is currently not available here.

Share

COinS