|
Symbolic Computation in VIS
Symbolic Computation in VIS
- Given a circuit with n latches, a state of the circuit is defined by the value of these latches
- Using V0 V1 V2 ....Vn-1 boolean variables, a state is represented by a minterm on these boolean variables, i.e., V0 V1 V2 ....Vn-1 = 010 .... 1
- A set of states is a collection of minterms and is represented by a function: f(v) = 1 <=> v is in set
- Transition between states is also represented by boolean functions : T(p,i,n) = 1 <=> In state p, on input i there is a transition to state n.
- Boolean functions represented as Binary Decision Diagram (BDD)
- Size of the BDD data structure critical
|
