‫االســــــــم ‪ :‬حـــــيــــدر‬

‫محـــــمـــد يــــــونــــس‬

‫القــــســـــم ‪ :‬هندسة تقنيات‬

‫القدرة الكهربائية ( مسائي )‬

‫الصـــــف ‪ :‬األول‬

‫المـــــــــادة ‪:‬‬
‫رقــــــمـــــيـــــة‬

‫اســــم التجــــربـــــة ‪:‬‬

‫‪Simplification using Karnaugh Map‬‬

‫رقــــم التجـــــربـــــة ‪)5( :‬‬

 Procedures
Part 1: 3 variables K-Map:.

Now we get the following truth table and we want to simplify it.
Table (5-1)

X Y Z OUTPUT
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

1. Find POS (Product Of Sum), and then connect the result circuit practically
POS

F = π (1,3,5)

F= (X+Y+Z') (X+Y'+Z') (X'+Y+Z')

X
1
Key = Space U4

U8
OR3

NOT
X1
Y
1 U5 U1 2.5 V
Key = Space

OR3 AND3
U9

NOT
Z
0 U6
Key = Space
U10
OR3

NOT
2. Simplify the Boolean function result in (a) by using K-map
xy
Z 00 00 01 11 10
0

1 0 0 0

3. Draw the result

F= (X+Z') logic function and then connect it practically, and find its truth table.
(Y+Z')

X U2 X1
1
Key = Space
OR2 U1 2.5 V
Y
1
Key = Space U3 AND2
Z
1 U10
OR2
Key = Space
NOT

X Y Z OUTPUT
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

Part 2: Four-variable K-Map:

OUT = A'B'CD+A'BCD+ABCD+AB'CD+ABC'D'+ABC'D+ABCD'

4. Find the truth table of the above logic equation.

X Y Z D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
 1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

5. Simplify the Boolean function above by using K-map.

SOP = (3,7,15,11,12,13,14)

AB
CD 00 00 01 11 10
00 1

01 1
11 1 1 1 1
10 1

F= AB+CD

6. Draw the result logic circuit, and then connect it practically, and find its truth table.
 U5
A
1
Key = Space AND4
U6
U12

NOT
AND4
B U7 X1 X2
1
Key = Space U2
2.5 V 2.5 V
U13 AND4
U8

NOT OR7
C
1 AND4
U9
Key = Space

U14
AND4
U10
NOT
D
1
Key = Space AND4
U1
U15

NOT AND4

U16

U11
AND2
U17
OR2

AND2

X Y Z D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

Discussion :
 1- Compare truth table that you got in step 3 with table (5-1), what is your notes?

After comparing the two tables, there was no difference in output

But the difference between the two sessions is complexity
Instead of using a complex circuit we can use a simple circuit with the same outputs
2- Compare truth tables in steps 6 and 4, what is your notes?

After comparing the two tables, there was no difference in output

But the difference between the two sessions is complexity
Instead of using a complex circuit we can use a simple circuit with the same outputs
3- Use a Karnaugh map to find the minimum (SOP) form for the expression:

Out = A'B'C'D' + A'B'CD' +AB'C'D' +AB'CD'

SOP = (0,2,8,10)

AB
00 01 11 10
CD 00 1 1

01
F= B'D'
11
10 1 1

4- Use a Karnaugh map to find the minimum (SOP) & (POS) form for the expression:

Out = A'B'C'D' + A'B'C'D +A'B'CD +A'BC'D' +A'BC'D +A'BCD +ABC'D' +ABC'D +

ABCD

SOP = (0,1,3,4,5,7,12,13,15)

POS = (2,6,8,9,10,11,14)
AB
00 00 01 11 10
CD 00 1 1 1 0

01 1 1 1 0
11 1 1 1 0
10 0 0 0 0
SOP = A'C'+BC'+A'D+BD

POS = (A'+B)(C'+D)

5- Implement the following Boolean function with NAND gates only:

F= £(1,2,3,4,5,7)

F= A'B'C + A'BC' + A'BC +AB'C' +AB'C +ABC