Realization of Complete Boolean Logic Functions using a Single Memtranstor

2019 ◽  
Vol 12 (5) ◽  
Author(s):  
Jianxin Shen ◽  
Peipei Lu ◽  
Dashan Shang ◽  
Young Sun
Keyword(s):  
Boolean Logic ◽  
Logic Functions

Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions

2017 ◽  
Vol 139 (30) ◽  
pp. 10176-10179 ◽  
Author(s):  
Xiangmeng Qu ◽  
Shaopeng Wang ◽  
Zhilei Ge ◽  
Jianbang Wang ◽  
Guangbao Yao ◽  
...  
Keyword(s):  
Cell Adhesion ◽  
Boolean Logic ◽  
On Chip ◽  
Logic Functions

scholarly journals A Novel Graphical Technique for Combinational Logic Representation and Optimization

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-12
Author(s):  
Vedhas Pandit ◽  
Björn Schuller
Keyword(s):  
Boolean Functions ◽  
Discrete Systems ◽  
Boolean Logic ◽  
Decision Diagrams ◽  
New Paradigm ◽  
Binary Decision ◽  
Graphical Technique ◽  
A New Technique ◽  
Logic Functions ◽  
Logical Functions

We present a new technique for defining, analysing, and simplifying digital functions, through hand-calculations, easily demonstrable therefore in the classrooms. It can be extended to represent discrete systems beyond the Boolean logic. The method is graphical in nature and provides complete ‘‘implementation-free” description of the logical functions, similar to binary decision diagrams (BDDs) and Karnaugh-maps (K-maps). Transforming a function into the proposed representations (also the inverse) is a very intuitive process, easy enough that a person can hand-calculate these transformations. The algorithmic nature allows for its computing-based implementations. Because the proposed technique effectively transforms a function into a scatter plot, it is possible to represent multiple functions simultaneously. Usability of the method, therefore, is constrained neither by the number of inputs of the function nor by its outputs in theory. This, being a new paradigm, offers a lot of scope for further research. Here, we put forward a few of the strategies invented so far for using the proposed representation for simplifying the logic functions. Finally, we present extensions of the method: one that extends its applicability to multivalued discrete systems beyond Boolean functions and the other that represents the variants in terms of the coordinate system in use.

Reconfigurable nonvolatile boolean logic with one-transistor-two-memristor for in-memory computing

2021 ◽  
Author(s):  
Ziling Wang ◽  
Li Luo ◽  
Jie Li ◽  
Lidan Wang ◽  
shukai duan
Keyword(s):  
Large Scale ◽  
Full Adder ◽  
Boolean Logic ◽  
Device Structure ◽  
Von Neumann ◽  
Computing Paradigm ◽  
Operation Process ◽  
Strong Candidate ◽  
High Flexibility ◽  
Logic Functions

Abstract In-memory computing is highly expected to break the von Neumann bottleneck and memory wall. Memristor with inherent nonvolatile property is considered to be a strong candidate to execute this new computing paradigm. In this work, we have presented a reconfigurable nonvolatile logic method based on one-transistor-two-memristor (1T2M) device structure, inhibiting the sneak path in the large-scale crossbar array. By merely adjusting the applied voltage signals, all 16 binary Boolean logic functions can be achieved in a single cell. More complex computing tasks including one-bit parallel full adder and Set-Reset latch have also been realized with optimization, showing simple operation process, high flexibility, and low computational complexity. The circuit verification based on cadence PSpice simulation is also provided, proving the feasibility of the proposed design. The work in this paper is intended to make progress in constructing architectures for in-memory computing paradigm.

Large Magnetoresistance and 15 Boolean Logic Functions Based on a ZnCoO Film and Diode Combined Device

2019 ◽  
Vol 5 (3) ◽  
pp. 1800812 ◽  
Author(s):  
Kun Zhang ◽  
Yue Zhang ◽  
Zhizhong Zhang ◽  
Zhenyi Zheng ◽  
Guanda Wang ◽  
...  
Keyword(s):  
Boolean Logic ◽  
Logic Functions

Implementation of Boolean Logic Functions in Charge Trap Flash for In-Memory Computing

2019 ◽  
Vol 40 (9) ◽  
pp. 1358-1361 ◽  
Author(s):  
Jaehong Lee ◽  
Byung-Gook Park ◽  
Yoon Kim
Keyword(s):  
Boolean Logic ◽  
Charge Trap ◽  
Logic Functions

scholarly journals Implementation of Complete Boolean Logic Functions in Single Complementary Resistive Switch

2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Shuang Gao ◽  
Fei Zeng ◽  
Minjuan Wang ◽  
Guangyue Wang ◽  
Cheng Song ◽  
...  
Keyword(s):  
Boolean Logic ◽  
Resistive Switch ◽  
Logic Functions

scholarly journals Contextual dependencies expand the re-usability of genetic inverters

2020 ◽  
Author(s):  
Huseyin Tas ◽  
Lewis Grozinger ◽  
Ruud Stoof ◽  
Victor de Lorenzo ◽  
Angel Goñi-Moreno
Keyword(s):  
Synthetic Biology ◽  
Computational Analysis ◽  
Logic Gate ◽  
Logic Gates ◽  
Boolean Logic ◽  
Regulatory Proteins ◽  
Genetic Circuits ◽  
Genetic Construct ◽  
Genetic Components ◽  
Logic Functions

The design and implementation of Boolean logic functions in living cells has become a very active field within synthetic biology. By controlling networks of regulatory proteins, novel genetic circuits are engineered to generate predefined output responses. Although many current implementations focus solely on the genetic components of the circuit, the host context in which the circuit performs is crucial for its outcome. Here, we characterise 20 genetic NOT logic gates (inverters) in up to 7 bacterial-based contexts each, to finally generate 135 different functions. The contexts we focus on are particular combinations of four plasmid backbones and three hosts, two Escherichia coli and one Pseudomonas putida strains. Each NOT logic gate shows seven different logic behaviours, depending on the context. That is, gates can be reconfigured to fit response requirements by changing only contextual parameters. Computational analysis shows that this range of behaviours improves the compatibility between gates, because there are considerably more possibilities for combination than when considering a unique function per genetic construct. Finally, we address the issue of interoperability and portability by measuring, scoring, and comparing gate performance across contexts. Rather than being a limitation, we argue that the effect of the genetic background on synthetic constructs expand the scope of the functions that can be engineered in complex cellular environments, and advocate for considering context as a fundamental design parameter for synthetic biology.

Skyrmion-Based Programmable Logic Device with Complete Boolean Logic Functions

2021 ◽  
Vol 15 (6) ◽  
Author(s):  
Z.R. Yan ◽  
Y.Z. Liu ◽  
Y. Guang ◽  
K. Yue ◽  
J.F. Feng ◽  
...  
Keyword(s):  
Boolean Logic ◽  
Programmable Logic ◽  
Logic Device ◽  
Programmable Logic Device ◽  
Logic Functions

scholarly journals Implementation of complete Boolean logic functions in single spin–orbit torque device

AIP Advances ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 015045
Author(s):  
Yunchi Zhao ◽  
Guang Yang ◽  
Jianxin Shen ◽  
Shuang Gao ◽  
Jingyan Zhang ◽  
...  
Keyword(s):  
Boolean Logic ◽  
Spin Orbit ◽  
Single Spin ◽  
Logic Functions

Quantum-Dot Devices and Quantum-Dot Cellular Automata

1997 ◽  
Vol 07 (10) ◽  
pp. 2199-2218 ◽  
Author(s):  
Wolfgang Porod
Keyword(s):  
Quantum Dots ◽  
Cellular Automata ◽  
Quantum Dot ◽  
Tunnel Junctions ◽  
Boolean Logic ◽  
Quantum Dot Cellular Automata ◽  
Nonlinear Networks ◽  
Binary Information ◽  
Logic Functions ◽  
Theoretic Description

We discuss novel nanoelectronic architecture paradigms based on cells composed of coupled quantum-dots. Boolean logic functions may be implemented in specific arrays of cells representing binary information, the so-called Quantum-Dot Cellular Automata (QCA). Cells may also be viewed as carrying analog information and we outline a network-theoretic description of such Quantum-Dot Nonlinear Networks (Q-CNN). In addition, we discuss possible realizations of these structures in a variety of semiconductor systems (including GaAs/AlGaAs, Si/SiGe, and Si/SiO 2), rings of metallic tunnel junctions, and candidates for molecular implementations.

Sign in / Sign up

Export Citation Format

Share Document