activity
20232026
most citedSolving Boolean satisfiability problems with resistive content addressable memories

16 citations · 39 across the 15 of their papers we have counts for

collaborators
Showing cs.ETShow all

7 papers · 1 filter

cs.ET2026

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…

cs.ET2025

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…

cs.ET2025

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…

cs.ET2025

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…

cs.ET2025★ 16 cited

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…

cs.ET2024★ 3 cited

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…

cs.ET2024★ 1 cited

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…