1 / 10

Bounded Sequential Equivalence Checking with Range-Equivalent Circuit, Node Merging , and NAR

Bounded Sequential Equivalence Checking with Range-Equivalent Circuit, Node Merging , and NAR. Speaker: Chih-Chung Wang. Outline. Problem Formulation Introduction BSEC Node merging NAR Range-equivalent circuit Simple Algorithm Flowchart Experimental Result Future Work.

rana-hanson
Download Presentation

Bounded Sequential Equivalence Checking with Range-Equivalent Circuit, Node Merging , and NAR

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Bounded Sequential Equivalence Checking with Range-Equivalent Circuit, Node Merging, and NAR Speaker: Chih-Chung Wang

  2. Outline • Problem Formulation • Introduction • BSEC • Node merging • NAR • Range-equivalent circuit • Simple Algorithm Flowchart • Experimental Result • Future Work

  3. Problem Formulation • Given: Two bounded sequential circuits, a bound k that using node merging and node addition and removal (NAR) optimizing will cost much time, where timeframe k-1 has been checked equivalent • Goal: Bounded sequential equivalence checking (BSEC) at timeframe koptimized by range-equivalent circuit replacement, node merging, and NAR

  4. Bounded Sequential Equivalence Checking (BSEC) • Bounded: timeframe k • Typical BSEC • Miter construction • Unroll • Sequential → Combinational

  5. Speeding Up • Circuit optimization • Node merging • Node addition and removal (NAR)

  6. Speeding Up • Range-equivalent circuit • Range • Range-equivalent • Circuit of timeframe 0 to k-1 replacement

  7. Resyn2 Original Optimized Construct miter pMiter Resyn2 NAR Optimize pMiterOpt timeframe 1 Resyn2 pFramePre Range-equivalent circuit replacement pRange timeframe k-1 Combine pFrame Resyn2 Optimize NAR pFrameOpt timeframe k Resyn2 SAT solver

  8. Experimental Result

  9. Experimental Result

  10. Future Work • Solving the problems in Range-equivalent functions • Segmentation Fault • Run time decreasing • Tuning the functions of the program and testcases • Finding the bound of timeframe k and checking if range-equivalent circuit replacement can solve the problem • Optimizing the program

More Related