most citedEfficient CMOS Invertible Logic Using Stochastic Computing

71 citations · 71 across the 1 of their papers we have counts for

collaborators

5 papers

cs.AR202671 cited

Efficient CMOS Invertible Logic Using Stochastic Computing

Sean C. Smithson, Naoya Onizawa, Brett H. Meyer +2

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 out…

cs.AR2026

Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing

Duckgyu Shin, Naoya Onizawa, Warren J. Gross +1

Simulated annealing (SA) is a well-known algorithm for solving combinatorial optimization problems. However, the computation time of SA increases rapidly, as the size of the proble…

cs.ET2026

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

Naoya Onizawa, Takahiro Hanyu

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…

cs.ET2026

Analog-to-Stochastic Converter Using Magnetic Tunnel Junction Devices for Vision Chips

Naoya Onizawa, Daisaku Katagiri, Warren J. Gross +1

This paper introduces an analog-to-stochastic converter using a magnetic tunnel junction (MTJ) device for vision chips based on stochastic computation. Stochastic computation has b…

math.OC2026

Fast Solving Complete 2000-Node Optimization Using Stochastic-Computing Simulated Annealing

Kota Katsuki, Duckgyu Shin, Naoya Onizawa +1

In this paper, we evaluate stochastic-computing simulated annealing (SC-SA) for solving large-scale combinatorial optimization problems. SC-SA is designed using stochastic computin…