47 citations · 135 across the 8 of their papers we have counts for
6 papers · 1 filter
FPIM: Field-Programmable Ising Machines for Solving SAT
Thomas Jagielski, Rajit Manohar, Jaijeet Roychowdhury
On-chip analog Ising Machines (IMs) are a promising means to solve difficult combinatorial optimization problems. For scalable on-chip realizations to be practical, 1) the problem…
Late Breaking Results: New Computational Results and Hardware Prototypes for Oscillator-based Ising Machines
Tianshi Wang, Leon Wu, Jaijeet Roychowdhury
In this paper, we report new results on a novel Ising machine technology for solving combinatorial optimization problems using networks of coupled self-sustaining oscillators. Spec…
OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems
Tianshi Wang, Jaijeet Roychowdhury
We present a new way to make Ising machines, i.e., using networks of coupled self-sustaining nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establ…
Oscillator-based Ising Machine
Tianshi Wang, Jaijeet Roychowdhury
Many combinatorial optimization problems can be mapped to finding the ground states of the corresponding Ising Hamiltonians. The physical systems that can solve optimization proble…
Well-Posed Models of Memristive Devices
Tianshi Wang, Jaijeet Roychowdhury
Existing compact models for memristive devices (including RRAM and CBRAM) all suffer from issues related to mathematical ill-posedness and/or improper implementation. This limits t…
Boolean Computation Using Self-Sustaining Nonlinear Oscillators
Jaijeet Roychowdhury
Self-sustaining nonlinear oscillators of practically any type can function as latches and registers if Boolean logic states are represented physically as the phase of oscillatory s…