SATISFIABILITY SWEEPING FOR SYNTHESIS

user-618b9067e554220b8f259598(2021)

引用 0|浏览15
暂无评分
摘要
A system and method for SAT-sweeping is disclosed. According to one embodiment, a method includes determining gate classes by inputting simulation patterns to gates in an integrated circuit design, selecting a candidate gate based on an inverse topological ordering of the gates, and then selecting a driver gate belonging to the same gate class as the candidate gate. A SAT-solver is called based on the candidate gate and the driver gate to confirm equivalence. The candidate gate and the driver gate are then merged in the integrated circuit design.
更多
查看译文
关键词
Topological sorting,Integrated circuit design,Equivalence (measure theory),Satisfiability,Topology,Inverse,Class (set theory),Computer science
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要