-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-2.txt
44 lines (29 loc) · 1.11 KB
/
test-2.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
BOOLEAN MINIMISATION V1.0
==========================
Minterms:
0 1 5 7 8 10 14 15
Don't cares:
3 6 11
The function order is 4
Prime Implicants:
p.i. cell literals cost status
1 0,8 -000 3 minimum-cost essential
2 0,1 000- 3 minimum-cost redundant
3 1,7 0--1 2 essential
4 3,15 --11 2 minimum-cost redundant
5 6,15 -11- 2 minimum-cost redundant
6 8,10 10-0 3 minimum-cost redundant
7 10,15 1-1- 2 minimum-cost essential
Prime Implicant Chart:
minterm -->
p.i. 0 1 5 7 8 10 14 15
1 * *
2 * *
3 * * *
4 * *
5 * * *
6 * *
7 * * *
Minimum Cost Solution:
F = 1+3+7
Cost = 7 literals