MultiValued Logic Synthesis多值逻辑综合.pptVIP

Binary Recursion Tree The recursive Shannon expansion corresponds to a binary recursion tree Example: Path ?(v) to node v corresponds to cube c?(v) Example: c?(v) = x1 x2 x3 Binary Recursion Tree The root represents the original function f. Each node v corresponds to fc?(v). If ever fc?(v) = 1 or 0 we can terminate the tree and replace v by 1 or 0. Such a node v is a leaf. Example Implicit Enumeration - Branch and Bound Checking for tautology and many other theoretically intractable problems (co-NP complete) can be effectively solved using implicit enumeration: use recursive Shannon expansion to explore Bn. In (hopefully) large subspaces of Bn, prune the binary recursion tree by exploiting properties of the node function fc?(v) exploiting heuristic bounding techniques even though in the worst case the recursion tree may have 2n nodes, in practice (in many cases), we typically encounter a linear number of nodes Implicit Enumeration - Branch and Bound Thus we say that the 2n min-terms of f have been implicitly enumerated BDD’s (Binary Decision Diagrams) are alternate representations in which implicit enumeration is performed statically, and nodes with identical path cofactors are identified (very important – we will discuss BDDs later!) Example This is not a tautology. In testing for tautology, we look for a cube subspace c such that fc=0. If we can find it then f is not the tautology. Can rule out complete cube subspace c’ if fc’=1 Tautology can be proved by finding {ci} such that ? ci = 1 and fci ? 1 for all ci. We don’t need that ci cj =?. Definition 1 A function f : Bn ? B is positive unate in variable xi iff This is equivalent to monotone increasing in xi: for all min-term pairs (m-, m+) where For example, m-3=1001, m+3=1011(where i=3) Similarly for negative unate monotone decreasing: A function is unate in xi if it is either positive unate or negative unate in xi. Definition 2 A function is unate if it is una