Lecture Notes - Combinational Circuits Examples
Lecture Notes - Combinational Circuits Examples
a. Boolean Expression.
b. Truth Table
A'
A' B
A' B + A B'
B
A B'
B'
Solution:
a.
A' B + A B'
b.
A B F
0 0 0
0 1 1
1 0 1
1 1 0
a. Boolean Expression.
b. Truth Table
P
P
P P' P + (P' + Q)
Q P' + Q
Solution:
a.
P Q Y
0 0 1
0 1 1
1 0 1
1 1 1
a. Boolean Expression.
b. Truth Table
Z
YZ
Y
Y'
YZ (X + Y')
X X + Y'
Solution:
a.
F = YZ (X + Y')
b.
It's better if we simplify the function in part a to express the function in a simpler form so that the Truth Table can be
obtained easily.
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
Example: For the circuit below, obtain it’s:
a. Boolean Expression.
b. Truth Table
AB
AB + C'
C'
D
( (AB + C') D)'
Solution: (AB + C') D
a.
X = ( (AB + C') D)'
X = (ABD + CD')'
b.
A B C D X
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0