FIMA: A Scalable Ferroelectric Compute-in-Memory Annealer for Accelerating Boolean Satisfiability

In-memory compute kernels present a promising approach for addressing data-centric workloads. However, their scalability—particularly for computationally intensive tasks solving combinatorial optimization problems such as Boolean Satisfiability (SAT), which are inherently difficult to decompose—remains a significant challenge. In this work, we propose a ferroelectric non-volatile memory (NVM)-based compute-in-memory annealer for solving the Boolean MaxSAT problem. We experimentally demonstrate the computational functionality of the NVM array using a compact 20×10 HZO/IWO-based FeFET array. More importantly, through experimentally calibrated simulations, we demonstrate that our solution is compatible with a modular memory architecture, allowing the problem sizes to exceed the capacity of a single memory array. Our approach not only addresses the size limitations imposed by the read margin of individual arrays but also opens new avenues for integrating such accelerators as back-end solutions in advanced computing platforms.

Authors

Institutions

Publication Details

Journal
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
Published
2025-01-01
DOI
https://doi.org/10.1109/jxcdc.2025.3603942
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FIMA: A Scalable Ferroelectric Compute-in-Memory Annealer for Accelerating Boolean Satisfiability

Nikhil Shukla, Suman Datta, Mohammad Khairul Bashar, Sourav Dutta et al.
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
Parallel Computing and Optimization Techniques
article

FIMA: A Scalable Ferroelectric Compute-in-Memory Annealer for Accelerating Boolean Satisfiability

Nikhil Shukla, Suman Datta, Mohammad Khairul Bashar, Sourav Dutta, Zongyi Li, Malihe Farasat, Vijaykrishnan Narayanan, Tanvir H. Pantha
article en

Abstract

In-memory compute kernels present a promising approach for addressing data-centric workloads. However, their scalability—particularly for computationally intensive tasks solving combinatorial optimization problems such as Boolean Satisfiability (SAT), which are inherently difficult to decompose—remains a significant challenge. In this work, we propose a ferroelectric non-volatile memory (NVM)-based compute-in-memory annealer for solving the Boolean MaxSAT problem. We experimentally demonstrate the computational functionality of the NVM array using a compact 20×10 HZO/IWO-based FeFET array. More importantly, through experimentally calibrated simulations, we demonstrate that our solution is compatible with a modular memory architecture, allowing the problem sizes to exceed the capacity of a single memory array. Our approach not only addresses the size limitations imposed by the read margin of individual arrays but also opens new avenues for integrating such accelerators as back-end solutions in advanced computing platforms.

IEEE Journal on Exploratory Solid-State Computational Devices and CircuitsVol. 11
Georgia Institute of Technology (US), Pennsylvania State University (US), The University of Texas at Dallas (US), University of Virginia (US)
National Science Foundation
Affordable and clean energy
Openalex Percentile: Top 76%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.