Open AccessReconfigurable and Efficient Implementation of 16 Boolean Logics and Full‐Adder Functions with Memristor Crossbar for Beyond von Neumann In‐Memory Computing
Author(s) -
Song Yujie,
Wang Xingsheng,
Wu Qiwen,
Yang Fan,
Wang Chengxu,
Wang Meiqing,
Miao Xiangshui
Publication year - 2022
Publication title -
advanced science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.388
H-Index - 100
ISSN - 2198-3844
DOI - 10.1002/advs.202200036
Subject(s) - crossbar switch , memristor , von neumann architecture , adder , computer science , parallel computing , boolean function , computer architecture , electronic engineering , algorithm , telecommunications , engineering , latency (audio) , operating system
The rise of emerging technologies such as Big Data, the Internet of Things, and artificial intelligence, which requires efficient power schemes, is driving brainstorming in data computing and storage technologies. In this study, merely relying on the fundamental structure of two memristors and a resistor, arbitrary Boolean logic can be reconfigured and calculated in two steps, while no additional voltage sources are needed beyond “± V P ” and 0, and all state reversals are based on memristor set switching. Utilizing the proposed logic scheme in an elegant form of unity structure and minimum cost, the implementation of a 1‐bit adder is demonstrated economically, and a promising circuit scheme for the N ‐bit adder is exhibited. Some critical issues including the crosstalk problem, energy consumption, and peripheral circuits are further simulated and discussed. Compared with existing works on memristive logic, such methods support building a memristor‐based digital in‐memory calculation system with high functional reconfigurability, simple voltage sources, and low power and area consumption.