EUVIMEDEUVIMED entdecken
Crossref

Training-free and stochastic magnetic tunnel junction-based restricted Boltzmann machine for Boolean satisfiability problem

Wei Duan, Zhen Cao, Kaiyuan Wang, Xiaozhou Ye, Long You

Applied Physics Letters · 26.05.2025 · 126 (21)

DOI: 10.1063/5.0240005 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Physics Letters, online erschienen am 27.05.2025. Verfasst von Wei Duan und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 26 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Interdisciplinary program of Wuhan National High Magnetic Field Center.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Traditional processors based on the von Neumann architecture are not efficient when dealing with combinatorial optimization problems, which has led to the proposal of unconventional algorithms and domain-specific computing architectures. Using probabilistic computing to implement invertible logic has emerged as a potential solution, with the primary challenges being the realization of high-quality random sources and efficient circuit mapping schemes. In this work, we propose a reliable design for invertible logic circuits based on stochastic spin-transfer torque magnetic tunnel junctions (MTJs) and validate it through SPICE simulations. To achieve this, we develop a physics-driven stochastic MTJ model using Verilog-A, which is then implemented to construct binary stochastic neurons for building restricted Boltzmann machines (RBMs). Using linear programming (LP), the stochastic MTJs are weighted and interconnected to construct elementary RBM-based invertible logic gates, including AND, OR, NOT, and NAND gates. Furthermore, through logic synthesis, invertible logic circuits capable of realizing arbitrary logic functions are achieved. RBMs whose weights are determined by LP not only eliminate the need for training but also enhance iteration speed. Finally, we demonstrate how to solve the Boolean satisfiability problem using the proposed invertible logic circuits. Power consumption and area estimations indicate that our design consumes fewer resources compared to pure CMOS implementations.

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Interdisciplinary program of Wuhan National High Magnetic Field Center
  • Huazhong University of Science and Technology, Shenzhen Virtual University Park
  • Shenzhen Science and Technology Program

Zitieren

APA

Duan, W., Cao, Z., Wang, K., Ye, X., & You, L. (2025). Training-free and stochastic magnetic tunnel junction-based restricted Boltzmann machine for Boolean satisfiability problem. Applied Physics Letters, 126(21). https://doi.org/10.1063/5.0240005

Vancouver

Duan W, Cao Z, Wang K, Ye X, You L. Training-free and stochastic magnetic tunnel junction-based restricted Boltzmann machine for Boolean satisfiability problem. Applied Physics Letters. 2025;126(21). doi:10.1063/5.0240005

BibTeX
@article{Duan2025,
  author = {Duan, Wei and Cao, Zhen and Wang, Kaiyuan and Ye, Xiaozhou and You, Long},
  title = {Training-free and stochastic magnetic tunnel junction-based restricted Boltzmann machine for Boolean satisfiability problem},
  journal = {Applied Physics Letters},
  year = {2025},
  volume = {126},
  number = {21},
  doi = {10.1063/5.0240005}
}
Kostenlos starten →