14 papers
Multi-primitive in-memory computing for Monte Carlo tree search
Tergel Molom-Ochir, Benjamin F. Morris, Yintao He +6
Monte Carlo tree search (MCTS) enables artificial intelligence (AI) decision-making, but requires 55-300 W on conventional processors, limiting edge deployment. In-memory computing…
Continuous-time nonlinear closed-loop in-memory computing for high-accuracy massive MIMO detection
Piergiulio Mannocci, Giacomo Pedretti, Fabian Böhm +1
Analog in-memory computing (IMC) has emerged as a promising approach for accelerating matrix operations by exploiting the intrinsic physics of memory arrays. To date, however, most…
Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing
Haesol Im, Fabian Böhm, Giacomo Pedretti +14
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…
Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
Haesol Im, Chan-Woo Yang, Moslem Noori +10
Research into the development of special-purpose computing architectures designed to solve quadratic unconstrained binary optimization (QUBO) problems has flourished in recent year…
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
Masoud Mohseni, Artur Scherer, K. Grace Johnson +48
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become po…
NL-DPE: An Analog In-memory Non-Linear Dot Product Engine for Efficient CNN and LLM Inference
Lei Zhao, Luca Buonanno, Archit Gajjar +9
Resistive Random Access Memory (RRAM) based in-memory computing (IMC) accelerators offer significant performance and energy advantages for deep neural networks (DNNs), but face thr…