HomeCall for PapersProgramCommitteePrevious ASAPsBest PaperUniversity of Manchester

A Parallel-friendly Majority Gate to Accelerate In-memory Computation

John Reuben1 and Stefan Pechmann2

1 Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany 2 Universität Bayreuth, Germany


Efforts to combat the ‘von Neumann bottleneck’ have been strengthened by Resistive RAMs (RRAMs), which enable computation in the memory array. Majority logic can accelerate computation when compared to NAND/NOR/IMPLY logic due to it’s expressive power. In this work, we propose a method to compute majority while reading from a transistor-accessed RRAM array. The proposed gate was verified by simulations using a physics-based model (for RRAM) and industry standard model (for CMOS sense amplifier) and, found to tolerate reasonable variations in the RRAMs’ resistive states. Together with NOT gate, which is also implemented in-memory, the proposed gate forms a functionally complete Boolean logic, capable of implementing any digital logic. Computing is simplified to a sequence of READ and WRITE operations and does not require any major modifications to the peripheral circuitry of the array. The parallel-friendly nature of the proposed gate is exploited to implement an eight-bit parallel-prefix adder in memory array. The proposed in-memory adder could achieve a latency reduction of 70% and 50% when compared to IMPLY and NAND/NOR logic-based adders, respectively.


[ Main Sponsor University of Manchester Logo Sponsoring Society IEEE Computer Society Logo Award Sponsor Qualcomm Logo ]