On the Implementation of Computation-in-Memory Parallel Adder

Hoang Anh Du Nguyen, Lei Xie, Mottaqiallah Taouil, Razvan Nane, Said Hamdioui, Koen Bertels

Research output: Contribution to journalArticleScientificpeer-review

26 Citations (Scopus)


Today's computer architectures suffer from many challenges, such as the near end of CMOS downscaling, the memory/communication bottleneck, the power wall, and the programming complexity. As a consequence, these architectures become inefficient in solving big data problems or general data intensive applications. Computation-in-memory (CIM) is a novel architecture that tries to solve/alleviate the impact of these challenges using the same device (i.e., the memristor) to implement the processor and memory in the same physical crossbar. In order to analyze its feasibility in depth, this paper proposes two memristor implementations of a data intensive arithmetic application (i.e., parallel addition). To the best of our knowledge, this is the first paper that considers the cost of the entire architecture including both crossbar and its CMOS controller. The results show that CIM architecture in general and the CIM parallel adder in particular have a high scalability. CIM parallel adder achieves at least two orders of magnitude improvement in energy and area in comparison with a multicore-based parallel adder. Moreover, due to a wide variety of memristor design methods (such as Boolean logic), tradeoffs can be made between the area, delay, and energy consumption.
Original languageEnglish
Pages (from-to)2206 - 2219
Number of pages14
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number8
Publication statusPublished - 2017


  • Boolean logic
  • computation-in-memory (CIM)
  • implication logic
  • parallel adder


Dive into the research topics of 'On the Implementation of Computation-in-Memory Parallel Adder'. Together they form a unique fingerprint.

Cite this