16 citations · 39 across the 15 of their papers we have counts for
15 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…
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…
Fault-Free Analog Computing with Imperfect Hardware
Zhicheng Xu, Jiawei Liu, Sitao Huang +9
The growing demand for edge computing and AI drives research into analog in-memory computing using memristors, which overcome data movement bottlenecks by computing directly within…
Hardware-Adaptive and Superlinear-Capacity Memristor-based Associative Memory
Chengping He, Mingrui Jiang, Keyi Shan +6
Brain-inspired computing aims to mimic cognitive functions like associative memory, the ability to recall complete patterns from partial cues. Memristor technology offers promising…
Real-time raw signal genomic analysis using fully integrated memristor hardware
Peiyi He, Shengbo Wang, Ruibin Mao +6
Advances in third-generation sequencing have enabled portable and real-time genomic sequencing, but real-time data processing remains a bottleneck, hampering on-site genomic analys…
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…
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…
Efficient Nonlinear Function Approximation in Analog Resistive Crossbars for Recurrent Neural Networks
Junyi Yang, Ruibin Mao, Mingrui Jiang +9
Analog In-memory Computing (IMC) has demonstrated energy-efficient and low latency implementation of convolution and fully-connected layers in deep neural networks (DNN) by using p…
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…
Parallel Tempering-Inspired Distributed Binary Optimization with In-Memory Computing
Xiangyi Zhang, Fabian Böhm, Elisabetta Valiante +7
In-memory computing (IMC) has been shown to be a promising approach for solving binary optimization problems while significantly reducing energy and latency. Building on the advant…
Computing High-Degree Polynomial Gradients in Memory
T. Bhattacharya, G. H. Hutchinson, G. Pedretti +6
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gra…
RACE-IT: A Reconfigurable Analog Computing Engine for In-Memory Transformer Acceleration
Lei Zhao, Aishwarya Natarajan, Luca Buonanno +6
Transformer models represent the cutting edge of Deep Neural Networks (DNNs) and excel in a wide range of machine learning tasks. However, processing these models demands significa…
X-TIME: An in-memory engine for accelerating machine learning on tabular data with CAMs
Giacomo Pedretti, John Moon, Pedro Bruel +11
Structured, or tabular, data is the most common format in data science. While deep learning models have proven formidable in learning from unstructured data such as images or speec…