Professional Documents
Culture Documents
TwoTwo-Level Logic
What is Two-Level Logic? TwoWhy Two Levels?
Universal Speed Simplicity
Cost Functions in Two-Level Circuits TwoNumber of gates Number of fanin (gate inputs)
ENEE 644 2
Quines PI Theorem
Review: Implicants and PIs:
Let f: BnpB A minterm is an implicant in which all literals appear exclusively An implicant with k literals has 2n-k such minterms, who share these k literals. An implicant l1lk is prime iff l1lj-1lj+1lk is not an implicant for all 1ejek. In the cubical representation, for an implicant with k literals, k = n: a vertex (minterm) n: k = n-1: an edge nz xyz yz xyz k = k: an (n-k)-dimension face (plane) k: (n
xyz (Quines Theorem [1952]) A minimal SOP must always y x xyz xyz x
2. Group by number of complement literals; 3. Merge terms in adjacent groups; Xy + Xy = X -- distance-1 merging distance4. Repeat step 3. until no new term is created.
ENEE 644 4
Check for: Xy + Xy = X All prime implicants: wxy, wxz, wyz, wyz, xy, xz More on Quines Method: o Easy to implement o Can handle dont cares q inefficient
ENEE 644 5
x x x x
x x x x
ENEE 644
o Start with any SOP form q Need to compare every pair of terms Do they have consensus? Does one contain the other?
ENEE 644 7
ENEE 644
QuineQuine-McCluskey Method
Problem: Given a Boolean function f (may be incomplete), find a minimum cost SOP formula.
# of literals
Q-M Procedure:
1. Generate all the PIs of f, {Pj} 2. Generate all the minterms of f, {mi} 3. Build the Boolean constraint matrix B, where Bij is 1 if mi Pj and is 0 otherwise 4. Solve the minimum column covering problem for B
ENEE 644
11
xy 1 1 1
xz 1
minimum cover(s):
1
1 1
1 1 1 1 1 1
12
More on Quine-McCluskey Method QuineGoal: find a minimum SOP form Why We Need to Find all PIs? f(w,x,y,z) = xy +wxy+xyz+wyz
= xy+xz+wxy+wyz = xy+xz+wxy+wxz = xy+xz+wxz+wyz
1. Are all terms PIs? 2. Is the form optimal? 3. Is the form unique?
ENEE 644
13
Quines PI Theorem
Review: Implicants and PIs:
Let f: BnpB xyz x A minterm is an implicant if the corresponding discriminant is 1. An implicant with k literals has 2n-k such minterms, who share these k literals. An implicant l1lk is prime iff l1lj-1lj+1lk is not an implicant for all 1ejek. In the cubical representation, for an implicant with k literals, k = n: a vertex (minterm) n: k = n-1: an edge n k = k: an (n-k)-dimension face (plane) k: (n
(Quines Theorem [1952]) A minimal SOP must always consist of a sum of prime implicants.
ENEE 644 14
Testability
Stuck-at- 0? Stuck-at-0? Stuck-atStuck-at-
0 0 x y A1
y z A3
? 1 x z A2