Equivalence Checking For Synchronous Elastic Circuits

被引:0
|
作者
Wijayasekara, Vidura [1 ]
Srinivasan, Sudarshan K. [1 ]
机构
[1] N Dakota State Univ, Dept Elect & Comp Engn, Fargo, ND 58104 USA
关键词
latency insensitive / elastic circuits; equivalence checking; refinement; LATENCY; REFINEMENT;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Synchronous elastic circuits are clock-based latency insensitive circuits. Elastic circuits are typically synthesized from synchronous circuits. After synthesis, additional buffers can be arbitrarily inserted in the data path of an elastic circuit without altering its functionality to resolve timing issues. We have developed a verification tool that can check the equivalence of an elastic circuit (even after the inclusion of any number arbitrarily placed additional buffers) with its synchronous parent circuit. The tool inputs elastic circuits in VHDL. We have developed an algorithm that automatically computes efficient mapping functions used to map elastic circuit states with states of the synchronous parent circuit. Such mapping functions (required for equivalence checking) can be challenging to compute automatically, as the inclusion of additional buffers can drastically alter the pattern of data flow through the circuit. The capacity of the equivalence checker is demonstrated with results from 24 elastic circuit benchmarks, many of which have over 100,000 gates and 1,000 latches.
引用
收藏
页码:109 / 118
页数:10
相关论文
共 50 条
  • [31] Advanced methods for equivalence checking of analog circuits with strong nonlinearities
    Sebastian Steinhorst
    Lars Hedrich
    Formal Methods in System Design, 2010, 36 : 131 - 147
  • [32] cecApprox: Enabling Automated Combinational Equivalence Checking for Approximate Circuits
    Jha, Chandan Kumar
    Hassan, Muhammad
    Drechsler, Rolf
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2024, 71 (07) : 3282 - 3293
  • [33] Advanced methods for equivalence checking of analog circuits with strong nonlinearities
    Steinhorst, Sebastian
    Hedrich, Lars
    FORMAL METHODS IN SYSTEM DESIGN, 2010, 36 (02) : 131 - 147
  • [34] Combining half adder graph for equivalence checking of arithmetic circuits
    Institute of VLSI Design, Zhejiang University, Hangzhou 310027, China
    Zhejiang Daxue Xuebao (Gongxue Ban), 2008, 8 (1345-1349+1403):
  • [35] Equivalence Checking of Quantum Circuits Based on Dirac Notation in Maude
    Canh Minh Do
    Ogata, Kazuhiro
    REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2024, 2024, 14953 : 84 - 103
  • [36] Equivalence Checking of Bounded Sequential Circuits based on Grobner Basis
    Wang Guanjun
    Zhao Ying
    Tong Minming
    2014 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2014), VOL 2, 2014,
  • [37] Logical Equivalence Checking of Asynchronous Circuits Using Commercial Tools
    Saifhashemi, Arash
    Huang, Hsin-Ho
    Bhalerao, Priyanka
    Beerel, Peter A.
    2015 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2015, : 1563 - 1566
  • [38] QuBEC: Boosting Equivalence Checking for Quantum Circuits With QEC Embedding
    Lu, Chao
    Choudhury, Navnil
    Banerjee, Utsav
    Saki, Abdullah Ash
    Basu, Kanad
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2024, 43 (07) : 2037 - 2042
  • [39] Equivalence checking of combinational circuits using Boolean expression diagrams
    Hulgaard, H
    Williams, PF
    Andersen, HR
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (07) : 903 - 917
  • [40] Equivalence checking of combinational circuits using Boolean expression diagrams
    Department of Information Technology, Technical University of Denmark, DK-2800 Lyngby, Denmark
    IEEE Trans Comput Aided Des Integr Circuits Syst, 7 (903-917):