DAG-Aware Synthesis Orchestration
Pages 4666 - 4675
Abstract
Modern logic synthesis techniques use multilevel technology-independent representations like and-inverter-graphs (AIGs) for digital logic. This involves structural rewriting, resubstitution, and refactoring based on directed-acyclic-graph (DAGs) traversal. Existing DAG-aware logic synthesis algorithms are designed to perform one specific optimization during a single DAG traversal. However, we empirically identify and demonstrate that these algorithms are limited in quality-of-results due to the solely considered optimization operation in the design concept. This work proposes synthesis orchestration, which is a fine-grained node-level optimization implying multiple optimizations during the single traversal of the graph. Our experimental results are comprehensively conducted on all 104 designs collected from ISCAS’85/89/99, VTR, and EPFL benchmark suites. The orchestration algorithms consistently outperform existing optimizations, rewriting, resubstitution, and refactoring, leading to an average of 4% more node reduction with reasonable runtime cost for the single optimization. Moreover, we evaluate the orchestration algorithm in the sequential optimization, and as a plug-in algorithm in resyn and resyn3 flows in ABC, which demonstrate consistent logic minimization improvements (1%, 4.7% and 11.5% more node reduction on average). Finally, we integrate the orchestration into OpenROAD for end-to-end performance evaluations. Our results demonstrate the advantages of the orchestration optimization techniques, even after technology mapping and post-routing in the design flow.
References
[1]
P. Bjesse and A. Boralv, “Dag-aware circuit compression for formal verification,” in Proc. IEEE/ACM Int. Conf. Comput. Aided Design, 2004, pp. 42–49.
[2]
W. Haaswijk et al., “Deep learning for logic optimization algorithms,” in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), 2018, pp. 1–4.
[3]
R. K. Brayton, G. D. Hachtel, and A. L. Sangiovanni-Vincentelli, “Multilevel logic synthesis,” Proc. IEEE, vol. 78, no. 2, pp. 264–300, 1990.
[4]
L. Amaru, P.-E. Gaillardon, and G. De Micheli, “Majority-inverter graph: A new paradigm for logic optimization,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 35, no. 5, pp. 806–819, May 2016.
[5]
A. Mishchenko et al., “ABC: A system for sequential synthesis and verification.” 2007. [Online]. Available: https://www.eecs.berkeley.edu/alanmi/abc
[6]
C. Yu, “Flowtune: Practical multi-armed bandits in boolean optimization,” in Proc. Int. Conf. Comput. Aided Design (ICCAD), 2020, pp. 1–9.
[7]
C. Yu, H. Xiao, and G. De Micheli, “Developing synthesis flows without human knowledge,” in Proc. 55th Annu. Des. Autom. Conf., 2018, pp. 1–6.
[8]
S. Rai et al., “Logic synthesis meets machine learning: Trading exactness for generalization,” in Proc. Des., Autom. Test Eur. Conf. Exhib. (DATE), 2021, pp. 1026–1031.
[9]
Y.-S. Huang, J.-H. R. Jiang, and A. Mishchenko, “Quantized neural network synthesis for direct logic circuit implementation,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. (TCAD), vol. 42, no. 2, pp. 473–482, Feb. 2023.
[10]
A. Mishchenko, S. Chatterjee, and R. Brayton, “DAG-aware AIG rewriting: A fresh look at combinational logic synthesis,” in Proc. Des. Autom. Conf. (DAC), 2006, pp. 532–535.
[11]
A. Mishchenko, S. Chatterjee, R. Jiang, and R. K. Brayton, “FRAIGs: A unifying representation for logic synthesis and verification,” Dept. EECS, University of California, Berkeley, CA, USA, Rep., 2005.
[12]
C. Yu, M. Ciesielski, M. Choudhury, and A. Sullivan, “Dag-aware logic synthesis of datapaths,” in Proc. 53rd Annu. Des. Autom. Conf., 2016, pp. 1–6.
[13]
M. Soeken, L. G. Amaru, P.-E. Gaillardon, and G. De Micheli, “Exact synthesis of majority-inverter graphs and its applications,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 36, no. 11, pp. 1842–1855, Nov. 2017.
[14]
Ç. Çalık, M. Sönmez Turan, and R. Peralta, “The multiplicative complexity of 6-variable boolean functions,” Cryptogr. Commun., vol. 11, no. 1, pp. 93–107, 2019.
[15]
W. Haaswijk, M. Soeken, L. Amarú, P.-E. Gaillardon, and G. De Micheli, “A novel basis for logic rewriting,” in Proc. ASP-DAC, 2017, pp. 151–156.
[16]
H. Riener, S.-Y. Lee, A. Mishchenko, and G. De Micheli, “Boolean rewriting strikes back: Reconvergence-driven windowing meets resynthesis,” in Proc. 27th ASP-DAC, 2022, pp. 395–402.
[17]
W. Haaswijk, A. Mishchenko, M. Soeken, and G. De Micheli, “SAT based exact synthesis using DAG topology families,” in Proc. 55th DAC, 2018, pp. 1–6.
[18]
R. B. Alan Mishchenko, “Scalable logic synthesis using a simple circuit structure,” in Proc. IWLS, vol. 6, 2006, pp. 15–22.
[19]
F. Brglez, D. Bryan, and K. Kozminski, “Combinational profiles of sequential benchmark circuits,” in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), 1989, pp. 1929–1934.
[20]
S. Davidson, “ITC’99 benchmark circuits-preliminary results,” in Proc. Int. Test Conf., 1999, pp. 1125–1125.
[21]
K. E. Murray et al., “VTR 8: High-performance CAD and customizable FPGA architecture modelling,” ACM Trans. Reconfig. Technol. Syst., vol. 13, no. 2, pp. 1–55, 2020.
[22]
M. Soeken et al., “The EPFL logic synthesis libraries,” 2018, arXiv:1805.05121.
[23]
T. Ajayi et al., “OpenROAD: Toward a self-driving, open-source digital layout implementation tool chain,” in Proc. GOMACTECH, 2019, pp. 1105–1110.
[24]
A. Hosny, S. Hashemi, M. Shalan, and S. Reda, “Drills: Deep reinforcement learning for logic synthesis,” in Proc. 25th Asia South Pac. Des. Autom. Conf. (ASP-DAC), 2020, pp. 581–586.
[25]
C. Wolf. “Yosys open synthesis suite.” 2016. [Online]. Available: https://yosyshq.net/yosys/
[26]
J. Knudsen, “Nangate 45-nm open cell library,” presented at CDNLive, EMEA, pp. 1–21, 2008.
Index Terms
- DAG-Aware Synthesis Orchestration
Index terms have been assigned to the content through auto-classification.
Recommendations
DAG-aware logic synthesis of datapaths
DAC '16: Proceedings of the 53rd Annual Design Automation ConferenceTraditional datapath synthesis for standard-cell designs go through extraction of arithmetic operations from the high-level description, high-level synthesis, and netlist generation. In this paper, we take a fresh look at applying high-level synthesis ...
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
DAC '06: Proceedings of the 43rd annual Design Automation ConferenceThis paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inverter Graphs (AIGs), a networks of two-input ANDs and inverters. The ...
Comments
Information & Contributors
Information
Published In
0278-0070 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 01 December 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025