Amaru, LucaMarranghello, FelipeTesta, EleonoraCasares, ChristopherPossani, ViniciusLuo, JiongVuillod, PatrickMishchenko, AlanDe Micheli, Giovanni2021-04-242021-04-242021-04-242020-01-0110.1109/DAC18072.2020.9218691https://infoscience.epfl.ch/handle/20.500.14299/177557WOS:000628528400196SAT-sweeping is a powerful method for simplifying logic networks. It consists of merging gates that are proven equivalent (up to complementation) by running simulation and SAT solving in synergy. SAT-sweeping is used in both verification and synthesis applications within EDA. In this paper, we focus on the development of a highly efficient, synthesis-oriented, SAT-sweeping engine. We introduce a new algorithm to guide initial simulation, which strongly reduces the number of false candidates for merge, thus increasing the computational efficiency of the sweeper. We revisit the SAT-sweeping flow in light of practical considerations for synthesis, with the aim of proving all valid merges and ensuring fast execution. Experimental results confirm remarkable speedup deriving from our methodology, up to 10x for large combinational networks, and better QoR as compared to previous SAT-sweeping implementation. Embedded in a commercial synthesis flow, our proposes SAT-sweeper enables area and power savings of 1.98% and 1.81 %, respectively, with neutral timing at negligible runtime overhead, over 36 testcases.Computer Science, Software EngineeringComputer Science, Theory & MethodsComputer Sciencetext::conference output::conference proceedings::conference paper