.png){kind=icon}
.png){kind=icon}
Return
An Ising Model-Based Annealing Processor With 1024 Fully Connected Spins for Combinatorial Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2023.3249763.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This brief presents a novel annealing processor (AP) design with 1024 fully-connected spins based on a modified Ising model annealing algorithm for combinatorial optimization problems. By adopting the proposed Turbo code-based interleaved random sequence generator (TCSG) and multi-spin update method, the memory usage is made considerable reduction and multi-spin parallel update is supported. The prototype is implemented using FPGA with the operation frequency of 100 MHz. We tested our design on various G-set problems with an average cut accuracy of 99.19% achieved. The proposed design outperforms the CPU-based method by achieving a max speedup of 1099x.
Keywords:
Ising model
simulated annealing
fully connected
combinatorial optimization problems
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W