High-Speed Memristor-Based Ripple Carry Adders in 1T1R Array Structure

Abstract

Memristor can store calculation results while computing, and utilizing memristor to realize in-memory computing is considered as one of the potential methods to break the bottleneck of Von Neumann architecture. To construct high performance computing systems, it is necessary to design memristor-based computing units with great advantages in delay, area, and integratability. This brief presents a high speed memristor-based <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> -bit ripple carry adder (RCA), with special design to facilitate the implementation with 1T1R arrays. After carries are calculated and aligned efficiently, we adopt Memristor-Aided LoGIC (MAGIC) to calculate and store the outputs of RCA in parallel, where The proposed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> -bit RCA only consists of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$5N+1$ </tex-math></inline-formula> memristors, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$8N+1$ </tex-math></inline-formula> MOSFETs, and its delay is <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N+4$ </tex-math></inline-formula> . Compared with the existing memristive RCA, the proposed RCA has great advantage in delay, while it is easy for integration in 1T1R array.