Chapter 4b Digital System - Logic Gates & Boolean Expression
Chapter 4b Digital System - Logic Gates & Boolean Expression
Commutative Law
x•y=y•x x+y=y+x
Identity Element
x•1=x x+0=x
Complement
x • x’ = 0 x + x’ = 1
Boolean Algebra Theorems
Duality
The dual of a Boolean algebraic expression is obtained by
interchanging the AND and the OR operators and
replacing the 1’s by 0’s and the 0’s by 1’s.
x•(y+z)=(x•y)+(x•z)
x+(y•z)=(x+y)•(x+z)
Theorem 1
x•x=x x+x=x
Theorem 2
x•0=0 x+1=1
Theorem 3: Involution
(x)=x
Theorem 5: DeMorgan
Theorem 6: Absorption
x•(x+y)=x x+(x•y)=x
DeMorgan’s Theorem on Gates
AND Gate
F=x•y F = (x • y) F=x+y
OR Gate
F=x+y F = (x + y) F=x•y
Example
2
1
3
Answer
1 2
3
Example
Use Boolean Algebra to simplify Boolean functions to
produce simpler circuits
F = BC + AB + AC
Product of Sums (POS)
AB(C + C )
BC ( A + A)
AC ( B + B)
F = AC ( B + B) + AB(C + C ) + BC ( A + A)
F = AC + AB + BC
F = ( A + C )( A + B)( B + C )
Sum of Products (SOP) B’
C
A
F = BC + AB + AC B’ F
A
C