TY - GEN

T1 - Automated synthesis of compact crossbars for sneak-path based in-memory computing

AU - Chakraborty, Dwaipayan

AU - Jha, Sumit Kumar

N1 - Publisher Copyright:
© 2017 IEEE.

PY - 2017/5/11

Y1 - 2017/5/11

N2 - The rise of data-intensive computational loads has exposed the processor-memory bottleneck in Von Neumann architectures and has reinforced the need for in-memory computing using devices such as memristors. Existing literature on computing Boolean formula using sneak-paths in nanoscale memristor crossbars has only focussed on short Boolean formula. There are two open questions: (i) Can one synthesize sneak-path based crossbars for computing large Boolean formula? (ii) What is the size of a memristor crossbar that can compute a given Boolean formula using sneak paths? In this paper, we make progress on both these problems. First, we show that the number of rows and columns required to compute a Boolean formula is at most linear in the size of the Reduced Ordered Binary Decision Diagram representing the Boolean function. Second, we demonstrate how Boolean Decision Diagrams can be used to synthesize nanoscale crossbars that can compute a given Boolean formula using naturally occurring sneak paths. In particular, we synthesize large logical circuits such as 128-bit adders for the first-time using sneak-path based crossbar computing.

AB - The rise of data-intensive computational loads has exposed the processor-memory bottleneck in Von Neumann architectures and has reinforced the need for in-memory computing using devices such as memristors. Existing literature on computing Boolean formula using sneak-paths in nanoscale memristor crossbars has only focussed on short Boolean formula. There are two open questions: (i) Can one synthesize sneak-path based crossbars for computing large Boolean formula? (ii) What is the size of a memristor crossbar that can compute a given Boolean formula using sneak paths? In this paper, we make progress on both these problems. First, we show that the number of rows and columns required to compute a Boolean formula is at most linear in the size of the Reduced Ordered Binary Decision Diagram representing the Boolean function. Second, we demonstrate how Boolean Decision Diagrams can be used to synthesize nanoscale crossbars that can compute a given Boolean formula using naturally occurring sneak paths. In particular, we synthesize large logical circuits such as 128-bit adders for the first-time using sneak-path based crossbar computing.

UR - http://www.scopus.com/inward/record.url?scp=85020198633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85020198633&partnerID=8YFLogxK

U2 - 10.23919/DATE.2017.7927093

DO - 10.23919/DATE.2017.7927093

M3 - Conference contribution

AN - SCOPUS:85020198633

T3 - Proceedings of the 2017 Design, Automation and Test in Europe, DATE 2017

SP - 770

EP - 775

BT - Proceedings of the 2017 Design, Automation and Test in Europe, DATE 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 20th Design, Automation and Test in Europe, DATE 2017

Y2 - 27 March 2017 through 31 March 2017

ER -