arrow
Return

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing

delete2026-02-19
delete0
delete
OA
AI
H
Haesol Im
F
Fabian Böhm
G
Giacomo Pedretti
N
Noriyuki Kushida
M
Moslem Noori
E
E. Valiante
X
Xiangyi Zhang
C
Chanwoo Yang
T
Tinish Bhattacharya
X
Xia Sheng
J
Jim Ignowski
A
Arne Heittmann
J
John Paul Strachan
M
Masoud Mohseni
R
Raymond Beausoleil
T
Thomas Van Vaerenbergh
I
Ignacio Rozada *
DOI:10.1038/s41467-026-69465-2delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by representing them with a combination of exclusive OR (XOR) and conjunctive normal form (CNF) clauses. We propose a hardware accelerator architecture that natively embeds and solves such hybrid XOR–CNF problems using in-memory computing hardware. To achieve this, we introduce an algorithm and demonstrate, both experimentally and through simulations, how it can be efficiently implemented with memristor crossbar arrays. Compared to the conventional approaches that translate XOR–CNF problems to pure CNF problems, our simulations show that the accelerator improves computation speed, energy efficiency, and chip area utilization of in-memory accelerators by  ~ 10 × for a set of hard cryptographic benchmarking problems. Moreover, the accelerator achieves a  ~ 10 × speedup and a  ~ 1000 × gain in energy efficiency over state-of-the-art SAT solvers running on CPUs. Finding solutions to the Boolean satisfiability problem (SAT) in computer science can be costly due to its computational complexity. Im and Böhm et al. propose a SAT solver accelerator architecture using in-memory computing hardware to achieve a  ~ 10 × speedup and a  ~ 1000 × gain in energy efficiency.
Keywords:
Computational science
Electrical and electronic engineering
Science
Humanities and Social Sciences
multidisciplinary
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Nature Communications cover
Nature Communications
IF:
15.7
Papers:
9.2W
Citations:
91.2W

Organization

F
forschungszentrum julich gmbh
Scholars:
209
Papers: 83
Citations: 0
1
1qb information technologies
Scholars:
12
Papers: 2
Citations: 0
U
university of california
Scholars:
1.9W
Papers: 8.0K
Citations: 10
H
hewlett packard enterprise
Scholars:
16
Papers: 8
Citations: 0
researcher View more organizations