File Download

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Monolithic 3D Oscillatory Ising Machine Using Reconfigurable FeFET Routing for Large-Scalability and Low-Power Consumption

Author(s)
Kim, Joon PyoKuk, Song-HyeonKim, Hyun WookJeong, JaeyongPark, JuhyukKim, Bong HoKim, JongminTodri-Sanial, AidaKim, Sanghyeon
Issued Date
2025-05
DOI
10.1002/advs.202413247
URI
https://scholarworks.unist.ac.kr/handle/201301/90850
Fulltext
https://advanced.onlinelibrary.wiley.com/doi/full/10.1002/advs.202413247
Citation
ADVANCED SCIENCE, v.12, no.18, pp.2413247
Abstract
Ising machines are attractive for efficiently solving NP-hard combinatorial optimization problems (COPs). In this work, a scalable monolithic-3D (M3D) oscillatory Ising machine (OIM) is proposed using ferroelectric field-effect transistors (FeFETs) serving as an in-memory routing switch (RS) and bi-stable resistor (biristor)-based oscillators for the first time. The M3D OIM achieves low static power consumption while offering high reconfigurability. Through careful control of FeFET routing switches, weights of the Ising model are embedded in coupled biristors. The performance is validated through simulations and experiments, in successfully solving King's graph sub-problems and the MaxCUT problem. By leveraging the intrinsic OIM features of parallel computing together with M3D integration, it is reported that the M3D OIM outperforms reported OIMs in scalability and speed. Such an approach provides new insights and significant potential for solving COPs.
Publisher
WILEY
ISSN
2198-3844
Keyword (Author)
m3dmaxcutoscillatorfefetising machine
Keyword
COMBINATORIAL OPTIMIZATION

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.