Lecture 11: Digital Logic Design - UCSB Computer Sciencehtzheng/teach/cs64s11/pdf/lecture11.pdf ·...
Transcript of Lecture 11: Digital Logic Design - UCSB Computer Sciencehtzheng/teach/cs64s11/pdf/lecture11.pdf ·...
From Truth Table Boolean Expression
Sum of the Product
F= ABC + BCD + DEF
Product of the Sum
F= (A+B+C) (B+C+D) (D+E+F)
CS 30
Sum of the Product
Each row of the truth table represents a product term
Product term -- each row in which the output column is a 1 contributes a single ANDed term of input variables to the Boolean expressions If the column associated with variable X has a 0 in it, the
expression X’ is part of the ANDed term., otherwise, X is part of the ANDed term
Sum of the product Product terms are ORed together
CS 30
Another Example
CS 30
1 1 Carry = A’B’+ AB Sum = A’B’ + A’B+ AB’
0 0 1 0 1 0 0 1
Carry = A’B+AB’ Sum = AB
What About Product of the Sum
CS 30
1 1 Carry = A’B’+ AB Sum = A’B’ + A’B+ AB’ Carry’= (A+B)(A’+B’) = C Sum’ = (A+B)(A+B’)(A’+B) =S
0 0 1 0 1 0 0 1
C = A’B+AB’ S = AB
C S
Product of the Sum
Each row of the truth table represents a sum term
Sum term -- each row in which the output column is a 0 contributes a single ORed term of input variables to the Boolean expressions If the column associated with variable X has a 0 in it, the
expression X is part of the ORed term.; If X has a 1 in it, then X’ is part of the ORed term
Product of the Sum Sum terms are ANDed together
CS 30
From Truth Table Boolean Expression
Sum of the Product
Find rows with output of 1
each product term, input X, x=0 use X’, x=1, use X
OR all the product terms together
Product of the Sum
Find rows with output of 0
each sum term, input X, x=0 use X, x=1, use X’
AND all the sum terms together
CS 30
Adjacencies of higher dimensions
CS 30
Eliminate 2 variables, reduce the expression into a single variable
What about higher dimensions…………….
The problem for humans is the difficulty of visualizing adjacencies in more than three dimensions.
Properties of K-Map
Any two adjacent (horizontal or vertical, but not diagonal) elements are distance 1 apart in the equivalent cube representation
CS 30
Rules of Simplification
Grouping together adjacent cells containing 1
Groups may not include any cell containing 0.
Groups may be horizontal or vertical, but not diagonal.
CS 30
CS 30
Groups may wrap around the table. The leftmost cell in a row may be grouped with the rightmost cell and the top cell in a column may be grouped with the bottom cell.
CS 30
There should be as few groups as possible, as long as this does not contradict any of the previous rules.
Don’t cares
X: don’t care.
Do not confuse this with an undefined value or a don’t know.
Any actual implementation of the circuit will generate some output for the don’t-care cases.
In a truth table, an X simply means that we have a choice of assigning a 0 or 1 to the truth table entry.
We should choose the value that will lead to the simplest implementation.
CS 30