New Ideas for Solving Covering Problems
New Ideas for Solving Covering Problems
复制标题
解决覆盖问题的新思路
DOI：
10.1145/217474.217603
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
J. Madre
中科院分区：
文献类型：
--
作者：
O. Coudert;J. Madre
覆盖问题发生在逻辑综合的几个步骤中，包括两级最小化和DAG覆盖。本文提出了一个更好的下界计算算法和两个新的修剪技术，显着提高覆盖问题求解器的效率。我们表明，这些技术减少了三个数量级的时间需要解决覆盖问题。
Covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of covering problem solvers. We show that these techniques reduce by up to three orders of magnitude the time required to solve covering problems exactly.