Formal Modeling and Verification of PCHB Asynchronous Circuits

被引:6
|
作者
Sakib, Ashiq A. [1 ]
Smith, Scott C. [2 ]
Srinivasan, Sudarshan K. [3 ]
机构
[1] Florida Polytech Univ, Dept Elect & Comp Engn, Lakeland, FL 33805 USA
[2] Texas A&M Univ, Dept Elect Engn & Comp Sci, Kingsville, TX 78363 USA
[3] North Dakota State Univ, Dept Elect & Comp Engn, Fargo, ND 58105 USA
基金
美国国家科学基金会;
关键词
Asynchronous circuits; equivalence verification; formal methods; precharge half buffer (PCHB); quasi-delay insensitive (QDI);
D O I
10.1109/TVLSI.2019.2937087
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification using custom synthesis tools. Design validation of the implemented QDI circuits mostly relies on extensive simulation, which may fail to detect corner-case bugs, especially in complex designs. Hence, a formal verification scheme for PCHB circuits is much needed. In this article, we present a formal verification methodology for PCHB circuits synthesized from a Boolean/synchronous specification, which is based on equivalence checking and can guarantee both safety (full functional correctness) and liveness (absence of deadlock). The approach is fast, scalable, and applicable to combinational as well as sequential PCHB circuits. We demonstrate the method using several multipliers, multiply and accumulate circuits (MACs), and IEEE International Symposium on Circuits and Systems (ISCAS) benchmarks.
引用
收藏
页码:2911 / 2924
页数:14
相关论文
共 50 条
  • [1] An Equivalence Verification Methodology for Combinational Asynchronous PCHB Circuits
    Sakib, Ashiq A.
    Smith, Scott C.
    Srinivasan, Sudarshan K.
    2018 IEEE 61ST INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS (MWSCAS), 2018, : 767 - 770
  • [2] Formal verification of peephole optimizations in asynchronous circuits
    Kong, XH
    Negulescu, R
    FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS, 2001, 69 : 219 - 234
  • [3] Test methodology for PCHB/PCFB Asynchronous Circuits
    Shen, Ting-Yu
    Pai, Chia-Cheng
    Chen, Tsai-Chieh
    Li, James Chien-Mo
    Pan, Samuel
    2018 IEEE INTERNATIONAL TEST CONFERENCE (ITC), 2018,
  • [4] Formal verification of pulse-mode asynchronous circuits
    Kong, XH
    Negulescu, R
    PROCEEDINGS OF THE ASP-DAC 2001: ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 2001, 2001, : 347 - 352
  • [5] Automatic optimization techniques for formal verification of asynchronous circuits
    Boubekeur, M.
    Schellekens, M. P.
    2007 14TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-4, 2007, : 283 - 286
  • [6] Towards Formal Verification of Reset Sequence in Fully Asynchronous Digital Circuits
    Melnychenko, Oleksandr
    Kreuter, Hans-Peter
    2014 10TH CONFERENCE ON PH.D. RESEARCH IN MICROELECTRONICS AND ELECTRONICS (PRIME 2014), 2014,
  • [7] AUTOMATIC VERIFICATION OF ASYNCHRONOUS CIRCUITS
    CLARKE, E
    MISHRA, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 164 : 101 - 115
  • [8] Timed verification of asynchronous circuits
    Moller, J
    Hulgaard, H
    Andersen, HR
    CONCURRENCY AND HARDWARE DESIGN: ADVANCED IN PETRI NETS, 2002, 2549 : 274 - 312
  • [9] Automatic verification of asynchronous circuits
    Lee, Trevor W.S.
    Greenstreet, Mark R.
    Seger, Carl-Johan
    IEEE Design and Test of Computers, 12 (01): : 24 - 31
  • [10] AUTOMATIC VERIFICATION OF ASYNCHRONOUS CIRCUITS
    LEE, TWS
    GREENSTREET, MR
    SEGER, CJ
    IEEE DESIGN & TEST OF COMPUTERS, 1995, 12 (01): : 24 - 31