期刊文献+

基于递归学习的组合电路等价性检验方法研究

Combinational equivalence check based on recursive learning
下载PDF
导出
摘要 等价性检验方法通常包括功能性和结构性的验证方法。分析了等价性检验的一般方法;并讨论了基于递归学习的组合电路等价性检验方法;算法利用直接蕴含和间接蕴含的方法,解决了布尔可满足问题。实验结果表明了该方法的有效性和可行性。 The equivalence check usually includes both functional and structural verifications. A general equivalence check method is analyzed. The combinational equivalence check methods based on recursive leaming algorithm are discussed. Both direct implication and indirect implication methods are used in this algorithm. Therefore the SAT is solved.
作者 曾琼
出处 《成都信息工程学院学报》 2006年第4期484-487,共4页 Journal of Chengdu University of Information Technology
基金 国家973计划资助项目(2004CB318003)
关键词 递归学习 等价性检验 组合电路 recursive leaming equivalence check combinational circuit
  • 相关文献

参考文献10

  • 1Dr.Eng.Ka Lok Man.Efficient Equivalence Checking of Industrial Designs[C].In Proc.of IEEE Design Verification Conference in Europe.2001:1-10.
  • 2Shi-Yu Huang,Kwang-Ting (Tim) Cheng,Formal Equivalence Checking and Design Debugging[M].Boston:Kluwer Academic Publishers.1998.
  • 3D.Brand.Verification of large synthesized designs[C].In Proceedings of International Conference of Computer-aided Design,1993:10-20.
  • 4H.Fujiwara,T.Shimono.On the acceleration of test generation algorithms[J].IEEE Trans.on Computers,1983,32(12):1137-1144.
  • 5M.Schulz,E.Frischler,T M.Sarfert.SOCRATES:A highly efficient automatic test pattern generation system[J].IEEE Transaction on Computer-Aided Design,1987,7(1):126-137.
  • 6Y.Matsunaga.An Efficient Equivalence Checker for Combinational Circuits[C].In 33rd Design Automation Conference,1996:629-634.
  • 7张镭,林争辉,吕宗伟.递归学习寻找对称变量[J].上海交通大学学报,2002,36(12):1709-1712. 被引量:1
  • 8李晓维 吕涛 李光辉.集成电路设计验证[J].中国科学院计算技术研究所内部刊物-信息技术快报,2004,(9).
  • 9李光辉,邵明,李晓维.基于BDD的组合电路等价性检验方法[J].微电子学与计算机,2003,20(2):48-51. 被引量:4
  • 10李光辉,邵明,李晓维.通用CPU设计验证中的等价性检验方法[J].计算机辅助设计与图形学学报,2005,17(2):230-235. 被引量:4

二级参考文献17

  • 1Tsai C, Mared-Sadowska M. Detecting symmetric variables in Boolean functions using generalized Reed-Muller forms[J]. IEEE Transaction on Computers, 1996,45(1) :33-40.
  • 2Tsai C, Mared-Sadowska M. Boolean functions classification via fixed polarity Reed-Muller forms[J].IEEE Transaction on Computer, 1997,46 (2): 173 -186.
  • 3Bryant R E. Graph based algorithms for Boolean function manipulation[J]. IEEE Transaction on Computers, 1986 ,C-35: 677- 691.
  • 4Kunz W, Pradhan D K. Recursive learning: an attractive alternative to the decision tree for test generation in digital circuits[A]. Proc Intl Test Conference[C]. Baltimore, Maryland, USA: IEEE Computer Society, 1992. 816-825.
  • 5Goel P. An implication enumeration algorithm to generate tests for combinational logic circuits [J].IEEE Transaction on Computer, 1981,30 (2): 215 -222.
  • 6Schulz M, Frischler E, Sarfert T M. SOCRATES:A highly efficient automaic test pattern generation system [J]. IEEE Transaction on Computer-Aided Design, 1987,7(1) : 126-137.
  • 7Park 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
  • 8Huang Shiyu, Cheng Kwangting. Formal Equivalence Checking and Design Debugging [M]. Boston: Kluwer Academic Publishers, 1998
  • 9Kern Christoph, Greenstreet Mark R. Formal verification in hardware design: A survey [J]. ACM Transactions on Design Automation of Electronic Systems, 1999, 4(2): 123~193
  • 10Eng Ka Lok Man. Efficient equivalence checking for industrial designs [A]. In: Proceedings of Design Verification Europe,Munich, 2001. 1~10

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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