Efficient CMOS Invertible Logic Using Stochastic Computing

Abstract

Invertible logic can operate in one of two modes: 1) a forward mode, in which inputs are presented and a single, correct output is produced, and 2) a reverse mode, in which the output is fixed and the inputs take on values consistent with the output. It is possible to create invertible logic using various Boltzmann machine configurations. Such systems have been shown to solve certain challenging problems quickly, such as factorization and combinatorial optimization. In this paper, we show that invertible logic can be implemented using simple spiking neural networks based on stochastic computing. We present a design methodology for invertible stochastic gates, which can be implemented using a small amount of CMOS hardware. We demonstrate that our design can not only correctly implement basic gates with invertible capability, but can also be extended to construct invertible stochastic adder and multiplier circuits. Experimental results are presented which demonstrate correct operation of synthesizable invertible circuitry performing both multiplication and factorization, along with fabricated ASIC measurement results for an invertible multiplier circuit.

References in corpus (7)

• Stochastic p-bits for Invertible Logic
• Synthesis and Optimization of Reversible Circuits - A Survey
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Hardware emulation of stochastic p-bits for invertible logic
• Low Barrier Nanomagnets as p-bits for Spin Logic
• Weighted p-bits for FPGA implementation of probabilistic circuits
• Ground State Spin Logic

Cited by in corpus (15)

• Massively Parallel Probabilistic Computing with Sparse Ising Machines
• The promise of spintronics for unconventional computing
• CMOS + stochastic nanomagnets: heterogeneous computers for probabilistic inference and learning
• Scalable Emulation of Sign-Problem$-$Free Hamiltonians with Room Temperature p-bits
• Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing
• Enhanced Convergence in p-bit Based Simulated Annealing with Partial Deactivation for Large-Scale Combinatorial Optimization Problems
• Physics-inspired Ising Computing with Ring Oscillator Activated p-bits
• Noise-augmented Chaotic Ising Machines for Combinatorial Optimization and Sampling
• Scalable Connectivity for Ising Machines: Dense to Sparse
• Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing
• Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
• GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling
• High Convergence Rates of CMOS Invertible Logic Circuits Based on Many-Body Hamiltonians
• pc-COP: An Efficient and Configurable 2048-p-Bit Fully-Connected Probabilistic Computing Accelerator for Combinatorial Optimization
• Ground-State Probabilistic Logic with the Simplest Binary Energy Landscape for Probabilistic Computing