Professional Documents
Culture Documents
Basic Definitions
Binary Operators
● AND
z=x•y=xy z=1 if x=1 AND y=1
● OR
z=x+y z=1 if x=1 OR y=1
● NOT
z = x = x’ z=1 if x=0
Boolean Algebra
● Binary Variables: only ‘0’ and ‘1’ values
● Algebraic Manipulation 2 / 28
Boolean Algebra Postulates
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
3 / 28
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) Applied to a valid
equation produces
● x+(y•z)=(x+y)•(x+z) a valid equation
Theorem 1
● x•x=x x+x=x
Theorem 2
● x•0=0 x+1=1
4 / 28
Boolean Algebra Theorems
Theorem 3: Involution
● ( x’ )’ = x (x)=x
Theorem 4: Associative & Distributive
● (x•y)•z=x•(y•z) (x+y)+z=x+(y+z)
● x•(y+z)=(x•y)+(x•z)
x+(y•z)=(x+y)•(x+z)
Theorem 5: DeMorgan
● ( x • y )’ = x’ + y’ ( x + y )’ = x’ • y’
● (x•y) =x +y (x+y) = x•y
Theorem 6: Absorption
● x•(x+y)=x x+(x•y)=x
5 / 28
Operator Precedence
Parentheses
x [ y z ( w x )]
( . . . ) • ( . . .)
NOT ( w x)
x’ + y ( w x)
AND z ( w x)
x+x•y
y z ( w x)
OR
x [ y z ( w x )]
6 / 28
DeMorgan’s Theorem
a [b c (d e )]
a [b c (d e )]
a b (c ( d e ))
a b (c (d e ))
a b (c (d e))
a b (c d e) 7 / 28
Boolean Functions
Boolean Expression
x y z F
Example: F = x + y’ z 0 0 0 0
Truth Table 0 0 1 1
0 1 0 0
All possible combinations
of input variables 0 1 1 0
1 0 0 1
Logic Circuit
1 0 1 1
x F 1 1 0 1
y
z 1 1 1 1
8 / 28
Algebraic Manipulation
Literal:
A single variable within a term that may be complemented
or not.
11 / 28
Canonical Forms
Maxterm
A B C Maxterm
● Sum (OR function)
0 0 0 0 M0 A B C
● Contains all variables
1 0 0 1 M1 A B C
● Evaluates to ‘0’ for a
2 0 1 0 M2 A B C
specific combination
3 0 1 1 M3 A B C
Example
4 1 0 0 M4 A B C
A=1 A B C
5 1 0 1 M5 A B C
B=1 (1) + (1) + (1)
6 1 1 0 M6 A B C
C=1 7 1 1 1 M7 A B C
0 + 0 + 0=0
12 / 28
Canonical Forms
Truth Table to Boolean Function
A B C F F A BC A BC A BC ABC
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
13 / 28
Canonical Forms
Sum of Minterms A B C F F
F ABC A BC A BC ABC 0 0 0 0 0 1
F m1 m4 m5 m7 1 0 0 1 1 0
2 0 1 0 0 1
F (1,4,5,7)
3 0 1 1 0 1
Product of Maxterms 4 1 0 0 1 0
F A BC ABC ABC ABC 5 1 0 1 1 0
F ABC ABC ABC ABC 6 1 1 0 0 1
7 1 1 1 1 0
F A BC ABC ABC ABC
F ( A B C )( A B C )( A B C )( A B C )
F M0 M2 M3 M6
F (0,2,3,6) 14 / 28
Standard Forms
Sum of Products (SOP)
A B(C C )
AB (1)
F A BC ABC A BC ABC
AB
AC ( B B)
AC
BC ( A A)
BC
F BC ( A A) AB(C C ) AC ( B B)
F BC A B AC
15 / 28
Standard Forms
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 )
16 / 28
Two - Level Implementations
Sum of Products (SOP) B’
C
F BC A B AC A
B’ F
A
C
Product of Sums (POS) A
C
A
F ( A C )( A B )( B C ) B’ F
B’
C
17 / 28
Logic Operators
AND x y AND
0 0 0
x x•y 0 1 0
y 1 0 0
1 1 1
18 / 28
Logic Operators
OR x y OR
0 0 0
x x+y 0 1 1
y 1 0 1
1 1 1
19 / 28
Logic Operators
XOR (Exclusive-OR) x y XOR
0 0 0
x xÅ y 0 1 1
y xy+xy 1 0 1
1 1 0
20 / 28
Logic Operators
NOT (Inverter) x NOT
0 1
x x
1 0
Buffer x Buffer
0 0
x x
1 1
21 / 28
Homework
Mano
● Chapter 2
♦ 2-4
♦ 2-5
♦ 2-6
♦ 2-8
♦ 2-9
♦ 2-10
♦ 2-12
♦ 2-15
♦ 2-18
♦ 2-19 22 / 28
Homework
Mano
2-4 Reduce the following Boolean expressions to the indicated
number of literals:
(a) A’C’ + ABC + AC’ to three literals
(b) (x’y’ + z)’ + z + xy + wz to three literals
(c) A’B (D’ + C’D) + B (A + A’CD) to one literal
(d) (A’ + C) (A’ + C’) (A + B + C’D) to four literals
23 / 28
Homework
2-6 Find the complement of the following expressions:
(a) xy’ + x’y (b) (AB’ + C)D’ + E
(c) (x + y’ + z) (x’ + z’) (x + y)
24 / 28
Homework
2-10 Draw the logic diagrams for the following Boolean
expressions:
(a) Y = A’B’ + B (A + C) (b) Y = BC + AC’
(c) Y = A + CD (d) Y = (A + B) (C’ + D)
0 0 0 1 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 0 1
25 / 28
Homework
2-15 Given the Boolean function
F = xy’z + x’y’z + w’xy + wx’y + wxy
(a) Obtain the truth table of the function.
(b) Draw the logic diagram using the original Boolean
expression.
(c) Simplify the function to a minimum number of literals
using Boolean algebra.
(d) Obtain the truth table of the function from the
simplified expression and show that it is the same as
the one in part (a)
(e) Draw the logic diagram from the simplified expression
and compare the total number of gates with the
diagram of part (b).
26 / 28
Homework
2-18 Convert the following to the other canonical form:
(a) F (x, y, z) = ∑ (1, 3, 7)
(b) F (A, B, C, D) = ∏ (0, 1, 2, 3, 4, 6, 12)
27 / 28