An official website of the United States government
Due to nucleic acid's programmability, it is possible to realize DNA structures with computing functions, and thus a new generation of molecular computers is evolving to solve biological and medical problems. Pioneered by Milan Stojanovic, Boolean DNA logic gates created the foundation for the development of DNA computers. Similar to electronic computers, the field is evolving towards integrating DNA logic gates and circuits by positioning them on substrates to increase circuit density and minimize gate distance and undesired crosstalk. In this minireview, we summarize recent developments in the integration of DNA logic gates into circuits localized on DNA substrates. This approach of all‐DNA integrated circuits (DNA ICs) offers the advantages of biocompatibility, increased circuit response, increased circuit density, reduced unit concentration, facilitated circuit isolation, and facilitated cell uptake. DNA ICs can face similar challenges as their equivalent circuits operating in bulk solution (bulk circuits), and new physical challenges inherent in spatial localization. We discuss possible avenues to overcome these obstacles.
more »
« less
SPICE Modeling of Memcomputing Logic Gates
Memcomputing logic gates generalize the traditional Boolean logic gates for operation in the reverse direction. According to the literature, this functionality enables efficient solution of computationally intensive problems, including factorization and NP-complete problems. To approach the deployment of memcomputing gates in hardware, this paper introduces SPICE models of memcomputing logic gates following their original definition. Using these models, we demonstrate the behavior of single gates as well as small self-organizing circuits. We have also corrected some inconsistencies in the prior literature. Notably, the correct schematics of the dynamic correction module is reported here for the first time. Our work makes memcomputing more accessible to those interested in this emerging computing technology.
more »
« less
- Award ID(s):
- 2229880
- PAR ID:
- 10505867
- Publisher / Repository:
- Brno University of Technology
- Date Published:
- Journal Name:
- Radioengineering
- Volume:
- 32
- Issue:
- 4
- ISSN:
- 1210-2512
- Page Range / eLocation ID:
- 542 to 556
- Subject(s) / Keyword(s):
- Memristors, SPICE, nonlinear dynamical systems, computing technology
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Due to nucleic acid’s programmability, it is possible to realize DNA structures with computing functions, and thus a new generation of molecular computers is evolving to solve biological and medical problems. There is evidence that genetic heredity diseases and cancer can be the result of genetic heterogeneity, thus there is a need for diagnostics and therapeutic tools with multiplex and smart components to compute all the molecular drivers. DNA molecular computers mimics electronic computers by programming synthetic nucleic acids to perform similarly to central processing units. Considering how the evolution of integrated circuits made possible the revolution of silicon-based computers, integrated DNA molecular circuits can be developed to allow modular designing and scale to complex DNA nano-processors. This dissertation covers the development of four-way junction (4J) DNA logic gates that can be wired to result in functionally complete gates, and their immobilization on a modular DNA board that serves as a scaffold for logic gate integration, fast signal processing, and cascading. Connecting 4J DNA logic gates YES and NOT resulted in OR, NAND, and IMPLY logic circuits; the three circuits can operate under the input of miRNAs, either oncogenic or/and tumor-suppressors, and give two possible diagnoses: healthy or cancerous. The DNA board can expand as the DNA circuit grows in the number of integrated 4J units. Signal propagation across a wired of 4J YES logic gates showed signal completion in < 3 min, accounting for a signal propagation rate of 4.5 nm/min and that up to 6 units can be cascaded before the signal dissipates. Lastly, an approach to chemically ligate all oligonucleotide components of the DNA molecular device is presented, in which we also found a route for the bioconjugation of 5’ to 5’ and 3’ to 3’ oligonucleotides.more » « less
-
Abstract The outsourcing of integrated circuit (IC) fabrication raises concerns of reverse-engineering, piracy, and overproduction of high-value intellectual property (IP). Logic locking was developed to address this by adding logic gates to a design to a chip’s functionality during fabrication. However, recent advances have revealed that logic locking is susceptible to physical probing attacks, such as electro-optical frequency mapping (EOFM). In this work, we proposeAdjoining Gates, a novel logic locking enhancement that places auxiliary logic gates near gates that leak key information when probed to obscure them, thereby mitigating EOFM-style attacks. To implement Adjoining Gates, we developed an open-source security verification and design automation algorithm that detects EOFM key leakage during placement and inserts Adjoining Gates in a design. Our evaluation shows that our proposed approach identified and mitigated all EOFM-extractable key leakage across 16 benchmarks of varying sizes, locking techniques, and probe resolutions with a 4.15% average gate count overhead.more » « less
-
We present a fully parallel digital memcomputing solver implemented on a field-programmable gate array (FPGA) board. For this purpose, we have designed an FPGA code that solves the ordinary differential equations associated with digital memcomputing in parallel. A feature of the code is the use of only integer-type variables and integer constants to enhance optimization. Consequently, each integration step in our solver is executed in 96 ns. This method was utilized for difficult instances of the Boolean satisfiability (SAT) problem close to a phase transition, involving up to about 150 variables. Our results demonstrate that the parallel implementation reduces the scaling exponent by about 1 compared to a sequential C++ code on a standard computer. Additionally, compared to C++ code, we observed a time-to-solution advantage of about three orders of magnitude. Given the limitations of FPGA resources, the current implementation of digital memcomputing will be especially useful for solving compact but challenging problems.more » « less
-
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). Upon activation of the field, each particle moves maximally in the same direction until forward progress is blocked by a stationary obstacle or another stationary particle. In an open workspace, this system model is of limited use because it has only two controllable degrees of freedom—all particles receive the same inputs and move uniformly. We show that adding a maze of obstacles to the environment can make the system drastically more complex but also more useful. We provide a wide range of results for a wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates AND, NAND, NOR, and OR operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a FAN-OUT gate cannot be generated. We resolve this missing component with the help of 2 9 1 particles, which can create FAN-OUT gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.13164/re.2023.0542
