期刊文献+

基于电路拓扑结构分析的等价性验证方法

Combinational Equivalence Checking Based on Circuit Topology Analysis
下载PDF
导出
摘要 随着集成电路设计规模的日益增大,结合多种推理引擎已成为组合电路形式化等价性验证的重要手段.提出一种基于电路拓扑结构分析的组合等价性验证方法,将电路的拓扑结构与验证算法的复杂性关联起来.在验证过程开始之前,利用min-cut方法计算表征电路复杂性的"电路宽度",以确定最佳的推理引擎,避免了传统的引擎切换过程,提高了算法的效率.针对ISCAS 85电路的实验结果表明了该方法的效率和可行性. With the increasing of VLSI circuit size, using multiple verification engines has been an important methodology of formal equivalence checking for combinational circuits. A combinational equivalence checking method based on circuit topology analysis is presented. This method can correlate the circuit topology to the complexity of verification algorithm, thus decide the optimal verification engine beforehand and improve the efficiency of equivalence checking. The experimental results on ISCAS'85 benchmark circuits show the efficiency and the feasibility of the proposed method.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2008年第12期1557-1562,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家“八六三”高技术研究发展计划(2008AA04Z132) 浙江省自然科学基金(Y106707) 浙江省科技厅重点项目(2007C21045)
关键词 组合电路 等价性验证 二叉判决图 布尔可满足性 combinational circuits equivalence checking binary decision diagram Boolean satisfiability
  • 相关文献

参考文献15

  • 1Anastasakis D, Damiano R, Ma H K, etal. A practical and efficient method for compare point matching[C] // Proceedings of the 39th ACM/IEEE Design Automation Conference, New Orleans, 2002:305-310.
  • 2Park J, Pixley C, Burns M, et al. An efficient logic equivalence checker for industrial circuits [J]. Journal of Electronic Testing: Theory and Applications, 2000, 16 (1/2): 91-106.
  • 3Huang S Y, Cheng K T. Formal equivalence checking and design debugging [J]. Boston: Kluwer Academic Publishers, 1998.
  • 4Burch J R, Singhal V. Tight integration of combinational verification methods [C] //Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, 1998:570-576.
  • 5Paruthi V, Kuehlmann A. Equivalence checking combining a structural SAT-solver, BDDs, and simulation[C] // Proceedings of IEEE/ACM International Conference on Computer Design: VLSI in Computers & Processors, San Jose, 2000:459-464.
  • 6Moskewicz M W, Madigan C F, Zhao Y, et al. Chaff: engineering an efficient SAT solver[C] //Proceedings of the 38th ACM/IEEE Design Automation Conference, Las Vegas, 2001:530-535.
  • 7Brand D. Verification of large synthesized designs [C]// Proceedings of IEEE/ACM International Conference on Computer-Aided Design, San Jose, 1993:534-537.
  • 8Berman C L. Circuit width, register allocation, and ordered binary decision diagrams [J]. IEEE Transactions on Computer-Aided Design, 1991, 10(8): 1059-1066.
  • 9Wang D, Clarke E, Zhu Y S, et al improve symbolic simulation and Boolean Using cutwidth to satisfiability [C]// Proceedings of the 6tb IEEE High Level Design Validation and Test Workshop, Austin, 2001:165-170.
  • 10Aloul F A, Markov I I., Sakallah K A. Efficient gate and input ordering for circuit to Bdd conversion[C]// Proceedings of International Workshop on Logic Synthesis, New Orleans, 2002.. 137-142.

二级参考文献45

  • 1Tracy Larrabee.Test pattern generation using Boolean satisfiability.IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems,1995,14( 1 ):4~ 15
  • 2Robert T Stanion,Debashis Bhattacharya,Carl Sechen.An efficient method for generating exhaustive test sets.IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems,1995,14(12):1516~1525
  • 3P Stephan,R K Brayton,A Sangiovanni-Vincenteli.Combinational test generation using satisfiability.IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems,1996,15(9):1167~1176
  • 4Emil Gizdaraki,Hidio Fujiwara.SPIRIT:A highly robust combinational test generation algorithm.IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems,2002,21(12):1446~1458
  • 5Randal E Bryant.Graph-based algorithms for Boolean function manipulation.IEEE Trans on Computers,1986,35(8):677~691
  • 6J Kim et al.On applying incremental satisfiability to delay fault testing.In:Proc of IEEE/ACM Design,Automation and Test in Europe Conference.Paris:ACM Press,2000.380~384
  • 7D Brand.Verification of large synthesized designs.In:Proc of Int'l Conf on Computer-Aided Design.San Joes:IEEE Press,1993.534~537
  • 8C Leonard Berman.Circuit width,register allocation,and ordered binary decision diagrams.IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems,1991,10(8):1059~1066
  • 9Mukul R Prasad,Philip Chong,Kurt Keutzer.Why is ATPG easy ? In:Proc of the Design Automatic Conference.New Orleans:ACM Press,1999.22~28
  • 10F Somenzi.CUDD:CU Decision Diagram Package.Release 2.3.1 [ CP],Boulder:University of Colorado,2001

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部