Professional Documents
Culture Documents
● An input of 0 is inverted to a 1 A Y
● An input of 1 is inverted to a 0 0 1
1 0
A Y
Input Output
Symbol
A
Y A B
B
A
Y B
B
A B Y
A
Y 0 0 1
B 0 1 1
1 0 1
Y=A.B 1 1 0
NOT X X
X X.Y
AND Y
X
OR X+Y
Y
A B Y
0 0 1
A
Y 0 1 0
B
1 0 0
Y=A+B 1 1 0
NOT X X
X
AND
X.Y
Y
OR X X+Y
Y
AND Gate
x y f
0 0 0
0 1 0
1 0 0
1 1 1
◼ Distributive Law:
● Note: To simplify notation, the • operator is frequently omitted.
When two elements are written next to each other, the AND (•)
operator is implied
A(B + C) = AB + AC
◼ Rule 1
OR Truth Table
◼ Rule 2
OR Truth Table
◼ Rule 3
◼ Rule 4
◼ Rule 5
OR Truth Table
◼ Rule 6
OR Truth Table
◼ Rule 7
◼ Rule 8
A .B = A + B
A + B = A .B
General:
A .B . C .D = A + B + C + D
A + B + C + D = A .B . C .D
(A .B + C) (A + B.C) =
(A .B + C) + (A + B.C) =
( A.B . C) + ( A .B.C) =
( A + B). C + A .(B + C) =
A.C + B.C + A.B + A.C =
A.C + B.C + A.B
To convert AND to OR
A B A B A B A B (or vice versa),
0 0 1 1 1 0 invert inputs and output.
0 1 1 0 0 1
1 0 0 1 0 1
1 1 0 0 0 1
Same as A+B
9/21/2020 COE211: Digital Logic Design 29
© 2006 Pearson Education, Inc., “Digital Fundamentals”, 9/e by Floyd
B
C
D
From De Morgan’s
Theorems
A
B
C
D
Circuit Boolean
Expression
Truth
Table
R = m3 + m5 + m6 + m7
R = ∑ (3, 5, 6, 7)
x y z G
0 0 0 0
0 0 1 0 ● ●
0 1 0 0 ●
G
0 1 1 1 ●
●
1 0 0 0 ●
1 0 1 0 ●
●
●
1 1 0 1
1 1 1 1
x y z
G = xyz + xyz’ + x’yz
9/21/2020 COE211: Digital Logic Design 36
Canonical Form of a Function
◼ A form is canonical if representation of a function in this
form is unique.
◼ Examples:
◼ Truth table representation of a function.
◼ Sum of minterms representation of a function.