Conditional Flood Fill Method in Logic Synthesis (2401.08625v1)
Abstract: In the field of Electronic Design Automation (EDA), logic synthesis plays a pivotal role in optimizing hardware resources. Traditional logic synthesis algorithms, such as the Quine-McCluskey method, face challenges in scalability and efficiency, particularly for higher-dimension problems. This paper introduces a novel heuristic algorithm based on Conditional Flood Fill Method aimed at addressing these limitations. Our method employs count-based adjacent element handling and introduces nine new theorems to guide the logic synthesis process. Experimental results validate the efficacy of our approach, showing significant improvements in computational efficiency and scalability compared to existing algorithms. The algorithm holds potential for future advancements in circuit development and Boolean function optimization.
- E. Testa, L. Amarú, M. Soeken, A. Mishchenko, P. Vuillod, P.-E. Gaillardon, and G. De Micheli, “Extending Boolean Methods for Scalable Logic Synthesis,” IEEE Access, vol. 8, pp. 226828–226844, 2020.
- J. McCarthy, M. L. Minsky, N. Rochester, and C. E. Shannon, “A proposal for the Dartmouth summer research project on artificial intelligence, August 31, 1955,” AI Magazine, vol. 27, no. 4, pp. 12–12, 2006.
- C. L. Philip Chen and C.-Y. Zhang, “Data-intensive applications, challenges, techniques and technologies: A survey on Big Data,” Information Sciences, vol. 275, pp. 314–347, 2014.
- L. Xu, Y. Yang, and R. Huang, “Research Frontiers of Memristor-Based Non-Volatile Logic,” China Basic Science, vol. 2, 2019.
- N. Bai and Z. Lin, “Optimize logic with key feature sets,” Journal of Computer-Aided Design & Computer Graphics, vol. 13, no. 9, pp. 860–864, 2001.
- C. E. Shannon, “The synthesis of two-terminal switching circuits,” The Bell System Technical Journal, vol. 28, no. 1, pp. 59–98, 1949.
- W. V. Quine, “The problem of simplifying truth functions,” The American Mathematical Monthly, vol. 59, no. 8, pp. 521–531, 1952.
- E. J. McCluskey, “Minimization of Boolean functions,” The Bell System Technical Journal, vol. 35, no. 6, pp. 1417–1444, 1956.
- M. Karnaugh, “The map method for synthesis of combinational logic circuits,” Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, vol. 72, no. 5, pp. 593–599, 1953.
- R. K. Brayton, G. D. Hachtel, L. A. Hemachandra, A. R. Newton, and A. L. Sangiovanni-Vincentelli, “A comparison of logic minimization strategies using Espresso, an APL program package for partitioned logic minimalization,” in Proc. 1982 Int. Symp. Circ. Syst, 1982.
- M. Theobald and S. M. Nowick, “Fast heuristic and exact algorithms for two-level hazard-free logic minimization,” IEEE Transactions on Computer Aided Design of Integrated Circuits & Systems, vol. 17, no. 11, pp. 1130–1147, 1998.
- G. Ammes and W. Lau Neto, “A Two-Level Approximate Logic Synthesis Combining Cube Insertion and Removal,” IEEE Transactions on Computer Aided Design of Integrated Circuits & Systems, vol. 41, no. 11, pp. 5129–5230, 2022.
- B. Song, J. Yan, and Z. Chen, “Rapid Knowledge Reduction of Large-scale Truth Table Based on Variable Granularity,” Computer Science, vol. 45, no. 7, pp. 170–171, 2018.