2,100 research outputs found
Ratchet Cellular Automata
In this work we propose a ratchet effect which provides a general means of
performing clocked logic operations on discrete particles, such as single
electrons or vortices. The states are propagated through the device by the use
of an applied AC drive. We numerically demonstrate that a complete logic
architecture is realizable using this ratchet. We consider specific
nanostructured superconducting geometries using superconducting materials under
an applied magnetic field, with the positions of the individual vortices in
samples acting as the logic states. These devices can be used as the building
blocks for an alternative microelectronic architecture.Comment: 4 pages, 3 figure
Design of Adiabatic MTJ-CMOS Hybrid Circuits
Low-power designs are a necessity with the increasing demand of portable
devices which are battery operated. In many of such devices the operational
speed is not as important as battery life. Logic-in-memory structures using
nano-devices and adiabatic designs are two methods to reduce the static and
dynamic power consumption respectively. Magnetic tunnel junction (MTJ) is an
emerging technology which has many advantages when used in logic-in-memory
structures in conjunction with CMOS. In this paper, we introduce a novel
adiabatic hybrid MTJ/CMOS structure which is used to design AND/NAND, XOR/XNOR
and 1-bit full adder circuits. We simulate the designs using HSPICE with 32nm
CMOS technology and compared it with a non-adiabatic hybrid MTJ/CMOS circuits.
The proposed adiabatic MTJ/CMOS full adder design has more than 7 times lower
power consumtion compared to the previous MTJ/CMOS full adder
Memcapacitive Devices in Logic and Crossbar Applications
Over the last decade, memristive devices have been widely adopted in
computing for various conventional and unconventional applications. While the
integration density, memory property, and nonlinear characteristics have many
benefits, reducing the energy consumption is limited by the resistive nature of
the devices. Memcapacitors would address that limitation while still having all
the benefits of memristors. Recent work has shown that with adjusted parameters
during the fabrication process, a metal-oxide device can indeed exhibit a
memcapacitive behavior. We introduce novel memcapacitive logic gates and
memcapacitive crossbar classifiers as a proof of concept that such applications
can outperform memristor-based architectures. The results illustrate that,
compared to memristive logic gates, our memcapacitive gates consume about 7x
less power. The memcapacitive crossbar classifier achieves similar
classification performance but reduces the power consumption by a factor of
about 1,500x for the MNIST dataset and a factor of about 1,000x for the
CIFAR-10 dataset compared to a memristive crossbar. Our simulation results
demonstrate that memcapacitive devices have great potential for both Boolean
logic and analog low-power applications
Research in the effective implementation of guidance computers with large scale arrays Interim report
Functional logic character implementation in breadboard design of NASA modular compute
Ground State Spin Logic
Designing and optimizing cost functions and energy landscapes is a problem
encountered in many fields of science and engineering. These landscapes and
cost functions can be embedded and annealed in experimentally controllable spin
Hamiltonians. Using an approach based on group theory and symmetries, we
examine the embedding of Boolean logic gates into the ground state subspace of
such spin systems. We describe parameterized families of diagonal Hamiltonians
and symmetry operations which preserve the ground state subspace encoding the
truth tables of Boolean formulas. The ground state embeddings of adder circuits
are used to illustrate how gates are combined and simplified using symmetry.
Our work is relevant for experimental demonstrations of ground state embeddings
found in both classical optimization as well as adiabatic quantum optimization.Comment: 6 pages + 3 pages appendix, 7 figures, 1 tabl
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
A digital computer is generally believed to be an efficient universal
computing device; that is, it is believed able to simulate any physical
computing device with an increase in computation time of at most a polynomial
factor. This may not be true when quantum mechanics is taken into
consideration. This paper considers factoring integers and finding discrete
logarithms, two problems which are generally thought to be hard on a classical
computer and have been used as the basis of several proposed cryptosystems.
Efficient randomized algorithms are given for these two problems on a
hypothetical quantum computer. These algorithms take a number of steps
polynomial in the input size, e.g., the number of digits of the integer to be
factored.Comment: 28 pages, LaTeX. This is an expanded version of a paper that appeared
in the Proceedings of the 35th Annual Symposium on Foundations of Computer
Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 199
- …