Efficient Approximate Decomposition Solver using Ising Model
Article No.: 177, Pages 1 - 6
Abstract
Computing with memory is an energy-efficient computing approach. It pre-computes a function and stores its values in a lookup table (LUT), which can be retrieved at runtime. Approximate Boolean decomposition reduces the LUT size for implementing complex functions, but it takes a long time to find a decomposition with a minimal error. In this work, to address this issue, we propose an efficient Ising model-based approximate Boolean decomposition solver. First, a new column-based approximate disjoint decomposition method is proposed to fit the Ising model. Then, it is adapted to the Ising model-based optimization solver. Moreover, two improvement techniques are developed for an efficient search of the approximate disjoint decomposition when using simulated bifurcation to solve the Ising model. Experimental results show that compared to the state-of-the-art work, our approach achieves a 11% smaller mean error distance with an average 1.16× speedup when approximately decomposing 16-input Boolean functions.
References
[1]
J. Cong et al., "Energy-efficient computing using adaptive table lookup based on nonvolatile memories," in ISLPED. IEEE, 2013, pp. 280--285.
[2]
Q. Xu et al., "Approximate computing: A survey," IEEE Design & Test, vol. 33, no. 1, pp. 8--22, 2016.
[3]
M. J. Schulte and J. E. Stine, "Symmetric bipartite tables for accurate function approximation," in ARITH. IEEE, 1997, pp. 175--183.
[4]
S.-F. Hsiao et al., "Hierarchical multipartite function evaluation," IEEE TC, vol. 66, no. 1, pp. 89--99, 2016.
[5]
M. Imani et al., "Resistive configurable associative memory for approximate computing," in DATE. IEEE, 2016, pp. 1327--1332.
[6]
A. Rahimi et al., "Approximate associative memristive memory for energy-efficient GPUs," in DATE. IEEE, 2015, pp. 1497--1502.
[7]
V.-S. Shen and A. C. Mckellar, "An algorithm for the disjunctive decomposition of switching functions," IEEE TC, vol. 100, no. 3, pp. 239--248, 1970.
[8]
Y. Yao et al., "Approximate disjoint bi-decomposition and its application to approximate logic synthesis," in ICCD. IEEE, 2017, pp. 517--524.
[9]
C. Meng et al., "DALTA: A decomposition-based approximate lookup table architecture," in ICCAD. IEEE, 2021, pp. 1--8.
[10]
X. Qian et al., "High-accuracy low-power reconfigurable architectures for decomposition-based approximate lookup table," in DATE, 2023, pp. 1--6.
[11]
B. H. Korte et al., Combinatorial optimization. Springer, 2011, vol. 1.
[12]
B. A. Cipra, "An introduction to the Ising model," Am. Math. Mon., vol. 94, no. 10, pp. 937--959, 1987.
[13]
T. Zhang et al., "A review of simulation algorithms of classical Ising machines for combinatorial optimization," in ISCAS. IEEE, 2022, pp. 1877--1881.
[14]
S. Kirkpatrick, "Optimization by simulated annealing: Quantitative studies," Journal of statistical physics, vol. 34, no. 5, pp. 975--986, 1984.
[15]
H. Goto et al., "Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems," Sci. Adv., vol. 5, no. 4, p. eaav2372, 2019.
[16]
K. Tatsumura et al., "Real-time trading system based on selections of potentially profitable, uncorrelated, and balanced stocks by NP-hard combinatorial optimization," arXiv preprint arXiv:2307.06339, 2023.
[17]
T. Zhang and J. Han, "Efficient traveling salesman problem solvers using the Ising model with simulated bifurcation," in DATE. IEEE, 2022, pp. 548--551.
[18]
A. Lucas, "Ising formulations of many NP problems," Front. Phys., 2014.
[19]
T. Kanao and H. Goto, "Simulated bifurcation for higher-order cost functions," Applied Physics Express, vol. 16, no. 1, p. 014501, 2022.
[20]
H. Goto et al., "High-performance combinatorial optimization based on classical mechanics," Sci. Adv., vol. 7, no. 6, p. eabe7953, 2021.
[21]
G. Guennebaud, B. Jacob et al., "Eigen v3," http://eigen.tuxfamily.org, 2010.
[22]
Gurobi Optimization, LLC, "Gurobi Optimizer Reference Manual," 2023. [Online]. Available: https://www.gurobi.com
[23]
A. Yazdanbakhsh et al., "AxBench: A multiplatform benchmark suite for approximate computing," IEEE Des. Test, vol. 34, no. 2, pp. 60--68, 2016.
Index Terms
- Efficient Approximate Decomposition Solver using Ising Model
Index terms have been assigned to the content through auto-classification.
Recommendations
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum degree of the ...
Exploring the renormalization of quantum discord and Bell non-locality in the one-dimensional transverse Ising model
In this paper, the effect of external magnet field g on the relationship among the quantum discord, Bell non-locality and quantum phase transition by employing quantum renormalization-group (QRG) method in the one-dimensional transverse Ising model is ...
Improving the exploitability of Simulated Adiabatic Bifurcation through a flexible and open-source digital architecture
Combinatorial Optimization (CO) problems exhibit exponential complexity, constraining classical computers from providing fast and satisfactory outcomes. Quantum Computers (QCs) can effectively find optimal or near-optimal solutions by exploring the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 November 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Natural Science Foundation of China
- Natural Sciences and Engineering Research Council of Canada
Conference
DAC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 46Total Downloads
- Downloads (Last 12 months)46
- Downloads (Last 6 weeks)25
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in