-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-5.txt
51 lines (36 loc) · 1.54 KB
/
test-5.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
45
46
47
48
49
50
51
BOOLEAN MINIMISATION V1.0
==========================
Minterms:
0 4 12 16 19 24 27 28 29 31
Don't cares:
*** none ***
The function order is 5
Prime Implicants:
p.i. cell literals cost status
1 0,16 -0000 4 non-essential
2 0,4 00-00 4 non-essential
3 4,12 0-100 4 non-essential
4 12,28 -1100 4 non-essential
5 16,24 1-000 4 non-essential
6 19,27 1-011 4 essential
7 24,28 11-00 4 non-essential
8 27,31 11-11 4 minimum-cost redundant
9 28,29 1110- 4 minimum-cost redundant
10 29,31 111-1 4 minimum-cost essential
Prime Implicant Chart:
minterm -->
p.i. 0 4 12 16 19 24 27 28 29 31
1 * *
2 * *
3 * *
4 * *
5 * *
6 * *
7 * *
8 * *
9 * *
10 * *
Minimum Cost Solution:
F = 6+10+(2+4+5)(1+3+7)
(parenthesised expressions are alternatives)
Cost = 20 literals