• English
  • Deutsch
  • Log In
    Password Login
    Research Outputs
    Fundings & Projects
    Researchers
    Institutes
    Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Scopus
  4. Device-Algorithm Co-Design of Ferroelectric Compute-in-Memory In-Situ Annealer for Combinatorial Optimization Problems
 
  • Details
  • Full
Options
2025
Conference Paper
Title

Device-Algorithm Co-Design of Ferroelectric Compute-in-Memory In-Situ Annealer for Combinatorial Optimization Problems

Abstract
Combinatorial optimization problems (COPs) are crucial in many applications but are computationally demanding. Traditional Ising annealers address COPs by directly converting them into Ising models (known as direct-E transformation) and solving them through iterative annealing. However, these approaches require vector-matrix-vector (VMV) multiplications with a complexity of O(n2) for Ising energy computation and complex exponential annealing factor calculations during annealing process, thus significantly increasing hardware costs. In this work, we propose a ferroelectric compute-in-memory (CiM) in-situ annealer to overcome aforementioned challenges. The proposed device-algorithm co-design framework consists of (i) a novel transformation method (first to our known) that converts COPs into an innovative incremental-E form, which reduces the complexity of VMV multiplication from O(n2) to O(n), and approximates exponential annealing factor with a much simplified fractional form; (ii) a double gate ferroelectric FET (DG FeFET)-based CiM crossbar that efficiently computes the in-situ incremental-E form by leveraging the unique structure of DG FeFETs; (iii) a CiM annealer that approaches the solutions of COPs via iterative incremental-E computations within a tunable back gate-based in-situ annealing flow. Evaluation results show that our proposed CiM annealer significantly reduces hardware overhead, reducing energy consumption by 1503 / 1716 × and time cost by 8.08/8.15 × in solving 3000 -node Max-Cut problems compared to two state-of-the-art annealers. It also exhibits high solving efficiency, achieving a remarkable average success rate of 98%, whereas other annealers show only 50% given the same iteration counts.
Author(s)
Qian, Yu
Zhejiang University
Huang, Xianmin
Zhejiang University
Wang, Ranran
Zhejiang University
Yang, Zeyu
Zhejiang University
Zhou, Min
Zhejiang University
Kämpfe, Thomas  orcid-logo
Fraunhofer-Institut für Photonische Mikrosysteme IPMS  
Zhuo, Cheng
Zhejiang University
Yin, Xunzhao
Zhejiang University
Mainwork
Proceedings Design Automation Conference
Funder
National Natural Science Foundation of China  
Conference
62nd ACM/IEEE Design Automation Conference, DAC 2025
Open Access
DOI
10.1109/DAC63849.2025.11133307
Additional link
Full text
Language
English
Fraunhofer-Institut für Photonische Mikrosysteme IPMS  
  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Contact
© 2024