High Convergence Rates of CMOS Invertible Logic Circuits Based on Many-Body Hamiltonians

Abstract

This paper introduces CMOS invertible-logic (CIL) circuits based on many-body Hamiltonians. CIL can realize probabilistic forward and backward operations of a function by annealing a corresponding Hamiltonian using stochastic computing. We have created a Hamiltonian that includes three-body interaction of spins (probabilistic nodes). It provides some degrees of freedom to design a simpler landscape of Hamiltonian (energy) than that of the conventional two-body Hamiltonian. The simpler landscape makes it easier to reach the global minimum energy. The proposed three-body CIL circuits are designed and evaluated with the conventional two-body CIL circuits, resulting in few-times higher convergence rates with negligible area overhead on FPGA.

arXiv comment5 pages

References in corpus (7)

• Stochastic p-bits for Invertible Logic
• Synthesis and Optimization of Reversible Circuits - A Survey
• VLSI Implementation of Deep Neural Network Using Integral Stochastic Computing
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Weighted p-bits for FPGA implementation of probabilistic circuits
• Efficient CMOS Invertible Logic Using Stochastic Computing
• Ground State Spin Logic

Cited by in corpus (2)

• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
• Ground-State Probabilistic Logic with the Simplest Binary Energy Landscape for Probabilistic Computing