Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 27 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 70 tok/s Pro
Kimi K2 117 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4 34 tok/s Pro
2000 character limit reached

BoolGebra: Attributed Graph-learning for Boolean Algebraic Manipulation (2401.10753v1)

Published 19 Jan 2024 in cs.AR, cs.AI, and cs.LG

Abstract: Boolean algebraic manipulation is at the core of logic synthesis in Electronic Design Automation (EDA) design flow. Existing methods struggle to fully exploit optimization opportunities, and often suffer from an explosive search space and limited scalability efficiency. This work presents BoolGebra, a novel attributed graph-learning approach for Boolean algebraic manipulation that aims to improve fundamental logic synthesis. BoolGebra incorporates Graph Neural Networks (GNNs) and takes initial feature embeddings from both structural and functional information as inputs. A fully connected neural network is employed as the predictor for direct optimization result predictions, significantly reducing the search space and efficiently locating the optimization space. The experiments involve training the BoolGebra model w.r.t design-specific and cross-design inferences using the trained model, where BoolGebra demonstrates generalizability for cross-design inference and its potential to scale from small, simple training datasets to large, complex inference datasets. Finally, BoolGebra is integrated with existing synthesis tool ABC to perform end-to-end logic minimization evaluation w.r.t SOTA baselines.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. P. Bjesse and A. Boralv, “Dag-aware circuit compression for formal verification,” in IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.   IEEE, 2004, pp. 42–49.
  2. W. Haaswijk, E. Collins, B. Seguin, M. Soeken, F. Kaplan, S. Süsstrunk, and G. De Micheli, “Deep learning for logic optimization algorithms,” in 2018 IEEE International Symposium on Circuits and Systems (ISCAS).   IEEE, 2018, pp. 1–4.
  3. R. K. Brayton, G. D. Hachtel, and A. L. Sangiovanni-Vincentelli, “Multilevel logic synthesis,” Proceedings of the 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 Transactions on CAD, vol. 35, no. 5, pp. 806–819, 2015.
  5. A. Mishchenko et al., “Abc: A system for sequential synthesis and verification,” URL http://www. eecs. berkeley. edu/alanmi/abc, vol. 17, 2007.
  6. C. Yu, “Flowtune: Practical multi-armed bandits in boolean optimization,” in International Conference On Computer Aided Design (ICCAD).   IEEE, 2020, pp. 1–9.
  7. W. L. Neto, Y. Li, P.-E. Gaillardon, and C. Yu, “Flowtune: End-to-end automatic logic optimization exploration via domain-specific multi-armed bandit,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022.
  8. C. Yu, H. Xiao, and G. De Micheli, “Developing synthesis flows without human knowledge,” in Proceedings of the 55th Annual Design Automation Conference, 2018, pp. 1–6.
  9. A. Mishchenko, S. Chatterjee, and R. Brayton, “DAG-aware AIG Rewriting: A Fresh Look at Combinational Logic Synthesis,” in Design Automation Conference (DAC), 2006, pp. 532–535.
  10. A. Mishchenko, S. Chatterjee, R. Jiang, and R. K. Brayton, “Fraigs: A unifying representation for logic synthesis and verification,” ERL Technical Report, Tech. Rep., 2005.
  11. C. Yu, M. Ciesielski, M. Choudhury, and A. Sullivan, “Dag-aware logic synthesis of datapaths,” in Proceedings of the 53rd Annual Design Automation Conference, 2016, pp. 1–6.
  12. C. Yu, M. Ciesielski, and A. Mishchenko, “Fast algebraic rewriting based on and-inverter graphs,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 37, no. 9, pp. 1907–1911, 2017.
  13. M. Soeken, L. G. Amaru, P.-E. Gaillardon, and G. De Micheli, “Exact synthesis of majority-inverter graphs and its applications,” IEEE Transactions on CAD (TCAD), 2017.
  14. Ç. Çalık, M. Sönmez Turan, and R. Peralta, “The multiplicative complexity of 6-variable boolean functions,” Cryptography and Communications, 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 ASP-DAC.   Ieee, 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 ASP-DAC, 2022.
  17. W. Haaswijk, A. Mishchenko, M. Soeken, and G. De Micheli, “SAT based exact synthesis using DAG topology families,” in DAC, 2018, pp. 1–6.
  18. A. M. R. Brayton, “Scalable logic synthesis using a simple circuit structure,” in Proc. IWLS, vol. 6, 2006, pp. 15–22.
  19. L. Alrahis, A. Sengupta, J. Knechtel, S. Patnaik, H. Saleh, B. Mohammad, M. Al-Qutayri, and O. Sinanoglu, “Gnn-re: Graph neural networks for reverse engineering of gate-level netlists,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 41, no. 8, pp. 2435–2448, 2021.
  20. G. Zhao and K. Shamsi, “Graph neural network based netlist operator detection under circuit rewriting,” in Proc. GLSVLSI, 2022.
  21. Z. He et al., “Graph learning-based arithmetic block identification,” in Proc. ICCAD, 2021.
  22. N. Wu and Y. Xie, “A survey of machine learning for computer architecture and systems,” ACM Comput. Surveys, 2022.
  23. N. Wu, Y. Li, C. Hao, S. Dai, C. Yu, and Y. Xie, “Gamora: Graph learning based symbolic reasoning for large-scale boolean networks,” DAC, 2023.
  24. C. Yu and W. Zhou, “Decision making in synthesis cross technologies using lstms and transfer learning,” in Proceedings of the 2020 ACM/IEEE Workshop on Machine Learning for CAD, 2020, pp. 55–60.
  25. J. Yin, Y. Li, D. Robinson, and C. Yu, “Respect: Reinforcement learning based edge scheduling on pipelined coral edge tpus,” DAC, 2023.
  26. C. Yu and Z. Zhang, “Painting on placement: Forecasting routing congestion using conditional generative adversarial nets,” in Proceedings of the 56th Annual Design Automation Conference 2019, 2019, pp. 1–6.
  27. A. Hosny, S. Hashemi, M. Shalan, and S. Reda, “Drills: Deep reinforcement learning for logic synthesis,” in 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC).   IEEE, 2020, pp. 581–586.
  28. Y. Li, M. Liu, M. Ren, A. Mishchenko, and C. Yu, “Dag-aware synthesis orchestration,” arXiv preprint arXiv:2310.07846, 2023.
  29. Z. Wang, C. Bai, Z. He, G. Zhang, Q. Xu, T.-Y. Ho, B. Yu, and Y. Huang, “Functionality matters in netlist representation learning,” in Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022, pp. 61–66.
  30. E. Ustun, C. Deng, D. Pal, Z. Li, and Z. Zhang, “Accurate operation delay prediction for fpga hls using graph neural networks,” in Proceedings of the 39th International Conference on Computer-Aided Design, 2020, pp. 1–9.
  31. N. Wu, Y. Xie, and C. Hao, “Ironman: Gnn-assisted design space exploration in high-level synthesis via reinforcement learning,” in Proceedings of the 2021 on Great Lakes Symposium on VLSI, 2021, pp. 39–44.
  32. Y.-C. Lu, T. Yang, S. K. Lim, and H. Ren, “Placement optimization via ppa-directed graph clustering,” in Proceedings of the 2022 ACM/IEEE Workshop on Machine Learning for CAD, 2022, pp. 1–6.
  33. E. Ustun, S. Xiang, J. Gui, C. Yu, and Z. Zhang, “Lamda: Learning-assisted multi-stage autotuning for fpga design closure,” in 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM).   IEEE, 2019, pp. 74–77.
  34. D. Pal, C. Deng, E. Ustun, C. Yu, and Z. Zhang, “Machine learning for agile fpga design,” Machine Learning Applications in Electronic Design Automation, pp. 471–504, 2022.
  35. L. Alrahis, J. Knechtel, and O. Sinanoglu, “Graph neural networks: A powerful and versatile tool for advancing design, reliability, and security of ics,” in Proceedings of the 28th Asia and South Pacific Design Automation Conference, 2023, pp. 83–90.
  36. S.-Y. Yu, R. Yasaei, Q. Zhou, T. Nguyen, and M. A. Al Faruque, “Hw2vec: A graph learning tool for automating hardware security,” in 2021 IEEE International Symposium on Hardware Oriented Security and Trust (HOST).   IEEE, 2021, pp. 13–23.
  37. W. L. Neto, M. T. Moreira, L. Amaru, C. Yu, and P.-E. Gaillardon, “Read your circuit: leveraging word embedding to guide logic optimization,” in Proceedings of the 26th Asia and South Pacific Design Automation Conference, 2021, pp. 530–535.
  38. W. L. Neto, M. T. Moreira, Y. Li, L. Amarù, C. Yu, and P.-E. Gaillardon, “Slap: A supervised learning approach for priority cuts technology mapping,” in 2021 58th ACM/IEEE Design Automation Conference (DAC).   IEEE, 2021, pp. 859–864.
  39. W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems, vol. 30, 2017.
  40. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets