An Area-Efficient Ising Machine based on Parallel Stochastic Cellular Automata Tempering

As a potential solver for combinatorial optimization problems (COPs), the convergence speed and accuracy of Ising machines still have room to be improved at the level of algorithm and architecture design. In this paper, a novel parallel stochastic cellular automata tempering (PSCAT) algorithm is proposed to enhance the performance of fully-connected Ising machines. Additionally, a modified temperature exchange probability is applied to reduce the number of replicas in the hardware implementation. The utilization of the spin update module is improved by reducing the flip decision block. The design prototype with 2,048 spins and 8 replicas is validated on FPGA. Using the K2000 max-cut problem as a benchmark, our design achieves a solution accuracy of $\mathbf{9 8. 9 4 \%}$ within 0.5 ms, which is higher than two state-of-the-art works.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/icta64028.2024.10860619
Citations
1
Primary Topic
Cellular Automata and Applications
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Area-Efficient Ising Machine based on Parallel Stochastic Cellular Automata Tempering

Enyi Yao, Yang Zhang, Xiangrui Wang
1 citations
Cellular Automata and Applications
0.36
article

An Area-Efficient Ising Machine based on Parallel Stochastic Cellular Automata Tempering

Enyi Yao, Yang Zhang, Xiangrui Wang
article en
1 citations

Abstract

As a potential solver for combinatorial optimization problems (COPs), the convergence speed and accuracy of Ising machines still have room to be improved at the level of algorithm and architecture design. In this paper, a novel parallel stochastic cellular automata tempering (PSCAT) algorithm is proposed to enhance the performance of fully-connected Ising machines. Additionally, a modified temperature exchange probability is applied to reduce the number of replicas in the hardware implementation. The utilization of the spin update module is improved by reducing the flip decision block. The design prototype with 2,048 spins and 8 replicas is validated on FPGA. Using the K2000 max-cut problem as a benchmark, our design achieves a solution accuracy of $\mathbf{9 8. 9 4 \%}$ within 0.5 ms, which is higher than two state-of-the-art works.

South China University of Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 32%
Cellular Automata and Applications
0.36
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.