Presentation is loading. Please wait.

Presentation is loading. Please wait.

A Semi-Canonical Form for Sequential Circuits Alan Mishchenko Niklas Een Robert Brayton UC Berkeley Michael Case Pankaj Chauhan Nikhil Sharma Calypto Design.

Published byBennett Jennings Modified over 8 years ago

Similar presentations

Presentation on theme: "A Semi-Canonical Form for Sequential Circuits Alan Mishchenko Niklas Een Robert Brayton UC Berkeley Michael Case Pankaj Chauhan Nikhil Sharma Calypto Design."— Presentation transcript:

1 A Semi-Canonical Form for Sequential Circuits Alan Mishchenko Niklas Een Robert Brayton UC Berkeley Michael Case Pankaj Chauhan Nikhil Sharma Calypto Design Systems

2 MOTIVATION Logic circuits often contain duplicate sub- circuits expressed in terms of different primary inputs This leads to redundant work Synthesis tools repeatedly analyze the same sub-circuits Verification tools repeatedly solve the same instances 2

3 MOTIVATION Key idea: identify duplicate sub-circuits Ideal solution: exact graph isomorphism May be expensive and hard to implement Our solution is heuristic Find a semi-canonical circuit structure Computation is similar to simulation Efficient and straight-forward to implement Uses only structural information No need for signal names and user hints 3

4 EXAMPLE Fanout count  {b}, {m} are unique Complemented outputs  {c} is unique Fanin level  {F}, {G} are unique 4 Consider unique attributes of each node

5 EXAMPLE Nodes that cannot be uniquely identified belong to the same equivalence class The above circuit has two equivalence classes of primary outputs: {F, F’}, {G, G’} 5 G’F’F’

6 AIG In this work, sequential circuits are represented as And-Inverter Graphs (AIGs) AIG is a Boolean network whose logic nodes are two-input AND-nodes and inverters Inverters are represented as complemented attributes AIG is a uniform and low-memory data- structure It allows for an efficient implementation of a variety of algorithms working on sequential circuits

7 ALGORITHM OVERVIEW Structural signature of a node is an integer number computed for the node using its location in the circuit Initially, signatures of all nodes are set to 0 Circuit is repeatedly traversed and signatures are updated Goal: assign unique signatures for as many nodes as possible Motivation for computing unique signatures If a node has a unique signature, it has been uniquely identified using its position in the circuit structure A one-to-one mapping between the nodes of two circuits can be found using unique signatures of their nodes If such mapping exists, the circuits are structurally isomorphic 7

8 ALGORITHM OVERVIEW Signature propagation is similar to circuit simulation During circuit simulation, values of the nodes are computed in a direct topological order During signature propagation, signatures of the nodes are computed in a direct (or reverse) topological order Edge value reflects the structure around an edge Depends on the position (logic level) of the driving node Depends on whether the edge is complemented or not Each time a node is traversed, edge values of its fanins (or fanouts) are added to the signature of the node 8

9 ALGORITHM OVERVIEW 9 4 1 3 5 6 8 7 2 0 0 0 0 0 0 0 0 12 15 19 71 42

10 ALGORITHM OVERVIEW When nodes cannot be uniquely identified using their structural signatures, tie breaking is used Choose the equiv class with the largest level Assign unique signatures to the class nodes Propagate signatures to other nodes until convergence If some equiv classes are left, repeat 10 71 42 15

11 IMPLEMENTATION Computation of unique signatures is implementation in ABC The unique signatures (which are integer numbers) are used to put nodes of a circuit in a semi-canonical order When nodes are written into a file in this order, the resulting file is a semi-canonical form of the circuit If files for two circuits are identical, the circuits are isomorphic Application 1: ABC command “write_aiger –u” Writes the netlist in a semi-canonical form Application 2: ABC command “&iso” Discards isomorphic POs 11

12 IMPLEMENTATION Application 1: ABC command “write_aiger – u” Writes the netlist in semi-canonical form Useful for quickly comparing AIGER netlists 12 Netlist N1 write_aiger -u N1.aig Netlist N2 write_aiger -u N2.aig diff

13 IMPLEMENTATION Application 2: ABC command “&iso” Derive a semi-canonical form for each PO Discard POs that have duplicate semi-canonical forms i.e. “drop isomorphic proof obligations” 13 G’F’ a' b’c’d’ Counterexamples/invariants on F/G can be re-mapped to F’/G’

14 EXPERIMENTAL RESULTS Test Case FFsANDsPOs POs after iso iso time (sec) POs after synt h. POs after iso iso tim e (sec ) SDCU 2442144188347273.2361 353.09 TPC_P 1619127094879516.00394 393.28 TCP_O 3838368905985534.78545 541.55 PC_T 256520101274258.55129.01 SDXIA 78227885860049032.04245.63 DU 1086484397946518 198.1 4458 432.80 Initial AIG Statistics Use industrial verification benchmarks Remove isomorphic POs Apply synthesis, remove proved POs Remove isomorphic POs (again) 14

15 CONCLUSION Previous work focused on computing functional symmetries and automorphisms simplifying reachability and SAT using symmetries To our knowledge, this is the first work on computing a structural semi-canonical form for sequential circuits Allows for caching intermediate circuits in EDA tools Future work may include: Speeding up propagation of node signatures Generalizing the algorithm to work for logic networks other than the traditional sequential AIGs 15

16 THANK YOU Public implementation is available in ABC https://bitbucket.org/alanmi/abc

Download ppt "A Semi-Canonical Form for Sequential Circuits Alan Mishchenko Niklas Een Robert Brayton UC Berkeley Michael Case Pankaj Chauhan Nikhil Sharma Calypto Design."

Similar presentations

Aaron Bradley University of Colorado, Boulder

Aaron Bradley University of Colorado, Boulder
FPGA Technology Mapping Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

FPGA Technology Mapping Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Technology Mapping.

Technology Mapping.
Introduction to Logic Synthesis Alan Mishchenko UC Berkeley.

Introduction to Logic Synthesis Alan Mishchenko UC Berkeley.
1 FRAIGs: Functionally Reduced And-Inverter Graphs Adapted from the paper “FRAIGs: A Unifying Representation for Logic Synthesis and Verification”, by.

1 FRAIGs: Functionally Reduced And-Inverter Graphs Adapted from the paper “FRAIGs: A Unifying Representation for Logic Synthesis and Verification”, by.
DAG-Aware AIG Rewriting Alan Mishchenko, Satrajit Chatterjee, Robert Brayton Department of EECS, University of California Berkeley Presented by Rozana.

DAG-Aware AIG Rewriting Alan Mishchenko, Satrajit Chatterjee, Robert Brayton Department of EECS, University of California Berkeley Presented by Rozana.
Wenlong Yang Lingli Wang State Key Lab of ASIC and System Fudan University, Shanghai, China Alan Mishchenko Department of EECS University of California,

Wenlong Yang Lingli Wang State Key Lab of ASIC and System Fudan University, Shanghai, China Alan Mishchenko Department of EECS University of California,
Faster Logic Manipulation for Large Designs Alan Mishchenko Robert Brayton University of California, Berkeley.

Faster Logic Manipulation for Large Designs Alan Mishchenko Robert Brayton University of California, Berkeley.
Electrical and Computer Engineering Archana Rengaraj ABC Logic Synthesis basics ECE 667 Synthesis and Verification of Digital Systems Spring 2011.

Electrical and Computer Engineering Archana Rengaraj ABC Logic Synthesis basics ECE 667 Synthesis and Verification of Digital Systems Spring 2011.
1 Alan Mishchenko UC Berkeley Implementation of Industrial FPGA Synthesis Flow Revisited.

1 Alan Mishchenko UC Berkeley Implementation of Industrial FPGA Synthesis Flow Revisited.
Good Programming Practices for Building Less Memory-Intensive EDA Applications Alan Mishchenko University of California, Berkeley.

Good Programming Practices for Building Less Memory-Intensive EDA Applications Alan Mishchenko University of California, Berkeley.
05/04/06 1 Integrating Logic Synthesis, Tech mapping and Retiming Presented by Atchuthan Perinkulam Based on the above paper by A. Mishchenko et al, UCAL.

05/04/06 1 Integrating Logic Synthesis, Tech mapping and Retiming Presented by Atchuthan Perinkulam Based on the above paper by A. Mishchenko et al, UCAL.
Combinational and Sequential Mapping with Priority Cuts Alan Mishchenko Sungmin Cho Satrajit Chatterjee Robert Brayton UC Berkeley.

Combinational and Sequential Mapping with Priority Cuts Alan Mishchenko Sungmin Cho Satrajit Chatterjee Robert Brayton UC Berkeley.
ABC: A System for Sequential Synthesis and Verification BVSRC Berkeley Verification and Synthesis Research Center Robert Brayton, Niklas Een, Alan Mishchenko,

ABC: A System for Sequential Synthesis and Verification BVSRC Berkeley Verification and Synthesis Research Center Robert Brayton, Niklas Een, Alan Mishchenko,
Logic Synthesis: Past and Future Alan Mishchenko UC Berkeley.

Logic Synthesis: Past and Future Alan Mishchenko UC Berkeley.
Cut-Based Inductive Invariant Computation Michael Case 1,2 Alan Mishchenko 1 Robert Brayton 1 Robert Brayton 1 1 UC Berkeley 2 IBM Systems and Technology.

Cut-Based Inductive Invariant Computation Michael Case 1,2 Alan Mishchenko 1 Robert Brayton 1 Robert Brayton 1 1 UC Berkeley 2 IBM Systems and Technology.
1 Stephen Jang Kevin Chung Xilinx Inc. Alan Mishchenko Robert Brayton UC Berkeley Power Optimization Toolbox for Logic Synthesis and Mapping.

1 Stephen Jang Kevin Chung Xilinx Inc. Alan Mishchenko Robert Brayton UC Berkeley Power Optimization Toolbox for Logic Synthesis and Mapping.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.

Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
Wenlong Yang Lingli Wang State Key Lab of ASIC and System Fudan University, Shanghai, China Alan Mishchenko Department of EECS University of California,

Wenlong Yang Lingli Wang State Key Lab of ASIC and System Fudan University, Shanghai, China Alan Mishchenko Department of EECS University of California,
Enhancing Model Checking Engines for Multi-Output Problem Solving Alan Mishchenko Robert Brayton Berkeley Verification and Synthesis Research Center Department.

Enhancing Model Checking Engines for Multi-Output Problem Solving Alan Mishchenko Robert Brayton Berkeley Verification and Synthesis Research Center Department.

Similar presentations

Ads by Google