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

Abstract

Abstract 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.