期刊文献+

面向等价性验证的锁存器匹配算法 被引量:2

Latch mapping algorithm for equivalence checking
下载PDF
导出
摘要 为了克服现有等价性验证技术中难以精确匹配锁存器的局限性,提出了一种结合多种方法的新型锁存器匹配算法.该算法结合任意模拟、局部二叉判决图、目标模拟3种方法来匹配锁存器,并使用了类似滤波器的思想,任意模拟对锁存器作初步快速匹配,提出的局部二叉判决图技术降低了发生内存爆炸的可能性,目标模拟则针对性地对锁存器作进一步的划分.ISCAS89电路实验结果表明,该算法与模拟和自动测试矢量生成等方法相比,在运行时间、占用内存和匹配精度等方面均体现出有效性,可用于处理较大规模的时序电路验证问题. A novel latch mapping technique for equivalence checking was proposed to overcome the limit of low accuracy of previous mapping methods. The algorithm combined random simulation, local ordered binary decision diagrams (BDD) and target simulation to do latch mapping. It was a filter-like method, where random simulation was used to do quick mapping, and local BDD and target simulation were alternatively used to do further mapping. The efficiency of the proposed approach was shown through its application to the ISCAS89 benchmark circuits.
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2006年第8期1293-1296,共4页 Journal of Zhejiang University:Engineering Science
基金 国家自然科学基金资助项目(90207002)
关键词 等价性验证 锁存器匹配 局部二叉判决图 目标模拟 equivalence checking latch mapping local BDD target simulation
  • 相关文献

参考文献7

  • 1ANDREAS KUEHLMANN,FLORIAN KROHM.Equivalence checking using cuts and heaps[C]∥ Proceeding of Design Automation Conference.Anaheim,CA,USA:IEEE Computer Society,1997:263-268.
  • 2严晓浪,郑飞君,葛海通,杨军.结合二叉判决图和布尔可满足性的等价性验证算法[J].电子学报,2004,32(8):1233-1235. 被引量:8
  • 3CHO H,PIXLEY C.Apparatus and method for deriving correspondences between storage elements of a first circuit model and storage elements of a second circuit model:U S,5 638 381[P].1997-06-10.
  • 4CAO W L,WALKER D M,RAJARSHI,et al.An efficient solution to the storage correspondence problem for large sequential circuits[C]∥Proceeding of Asian and Southern Pacific Design Automation Conference.Yokohama,Japan:IEEE Computer Society,2001:181-186.
  • 5BOPPANA V,MUKHERJEE R,FUJITA M.Storage Correspondence for large sequential circuits[C]∥Proceeding of International Workshop on Logic Synthesis.Lake Tahoe,CA,USA:IEEE Computer Society,1998.
  • 6ANASTASAKIS D,DAMIANO R,MA T,et al.A practical and efficient method for compare-point matching[C]∥ Proceeding of the 39th Design Automation Conference.New Orleans,Louisiana,USA:IEEE Computer Society,2002:305-310.
  • 7VAN EIJK C.Formal verification for the verification of digital circuits[D].Eindhoven:Eindhoven University of Technology,1997.

二级参考文献11

  • 1Thomas Kropf.Introduction to Formal Hardware Verification[M].Berlin,Germany:Springer Press,1999.
  • 2R E Bryant.Graph-based algorithms for boolean function manipulation[J].IEEE Trans Computers,1986,C-35:677-691.
  • 3D Brand.Verification of large synthesized designs[A].ICCAD[C].San Jose,USA,1993.534-537.
  • 4M Moskewicz,C Madigan,Y Zhao,L Zhang,S Malik.Chaff:Engineering an efficient SAT solver[A].DAC[C].Las Vegas,USA,2001.530-535.
  • 5E Goldberg,M R Prasad,R K Brayton.Using SAT for combinational equivalence checking[A].DATE[C].Munich Germany,2001.114-121.
  • 6Y Matsunaga.An efficient equivalence checker for combinational circuits[A].DAC[C].Las Vegas,USA,1996.629-634.
  • 7Andreas Kuehlmann,Florian Krohm.Equivalence checking using cuts and heaps[A].DAC[C].Anaheim,USA,1997.263-268.
  • 8C L Berman,L H Trevillyan.Functional comparison of logic designs for VLSI circuits[A].ICCAD[C].Santa,Clara,USA,1989.456-459.
  • 9Andreas Kuehlmann,Viresh Paruthi,Florian Krohm,Malay K.Ganai.Robust boolean reasoning for equivalence checking and functional property verification[J].IEEE Trans CAD,2002,C-21:1377-1394.
  • 10Malay K Ganai,Lintao Zhang,Pranav Ashar,Aarti Gupta,Sharad Malik.Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT[A].DAC[C].New Orleans,USA,2002.747-750

共引文献7

同被引文献18

  • 1柯宪明,唐璞山.结合模拟蕴含技术的电路验证方法[J].微电子学与计算机,2007,24(2):58-61. 被引量:3
  • 2魏萌,唐璞山.一种基于状态转换图的时序电路等价验证算法[J].微电子学与计算机,2007,24(7):112-114. 被引量:1
  • 3Hassoun S, Sasao T, Brayton R K. Logic Synthesis and Verification [M]. Boston/Dordrecht/London: Kluwer Academic Publishers, 2002
  • 4Burch J R,Singhal V. Robust Latch Mapping for Combinational Equivalence Checking [C]//Proceedings of IEEE International Conference on Computer-Aided Design (ICCAD). San Jose,CA, USA, November 1998 : 563-569
  • 5Ng K, Prasad M R, Mukherjee R, et al. Solving the Latch Mapping Problem in fin Industrial Setting [C]//Proceedings of IEEE/ACM Design Automation Conference (DAC' 2003). Anaheim, CA, USA, June 2003 : 442-447
  • 6Anastasakis D, Damiano R, et al. A Practical and Efficient Method for Compare-Point Matching [C]. DAC, New Orleans, LA, USA,June 2002 : 305-310
  • 7van Eijk C,Jess J A G. Detection of Equivalent State Variables in Finite State Machine Verification[C]//Proceedings of ACM/ IEEE International Workshop on Logic Synthesis. Lake Tahoe, California, USA, 1995 : 335-344
  • 8MohnkeJ , Molitor P, Malik S. Establishing Latch Correspondenee for Sequential Circuits Using Distinguishing Signatures [C] //Proeeedings of IEEE Midwest Symposium on Circuits and Systems (MWSCAS),Saeramento,CA,USA,August 1997.
  • 9Cao Wanlin,Walker D M H,Mukherjee R. An efficient solution to the storage correspondence problem forlarge sequential circuits[C]//Proceedings of Asia and South Pacific Design Autamation Conference (ASP-DAC). Yokohama, Japan, January 30- February 2,2001 :181-186
  • 10Burch J R, Clarke E M, et al. Symbolic Model Checking for Sequential Circuit Verification [J]. IEEE Transactions On Computer-Aided Design, 1994,13(4) : 401-424

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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