-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-4.txt
69 lines (54 loc) · 2.47 KB
/
test-4.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
BOOLEAN MINIMISATION V1.0
==========================
Minterms:
1 4 5 7 8 9 11 13 14 15 18 19 20 21 23 24 25 26 27 28 29 30
Don't cares:
0 10 17 31
The function order is 5
Prime Implicants:
p.i. cell literals cost status
1 0,9 0-00- 3 non-essential
2 0,5 00-0- 3 non-essential
3 1,29 ---01 2 minimum-cost redundant
4 4,21 -010- 3 non-essential
5 5,31 --1-1 2 essential
6 8,27 -10-- 2 non-essential
7 9,31 -1--1 2 minimum-cost redundant
8 10,31 -1-1- 2 essential
9 17,31 1---1 2 minimum-cost redundant
10 18,27 1-01- 3 essential
11 20,29 1-10- 3 non-essential
12 24,31 11--- 2 non-essential
Prime Implicant Chart:
minterm -->
p.i. 1 4 5 7 8 9 11 13 14 15 18
1 * * *
2 * * *
3 * * * *
4 * *
5 * * * *
6 * * *
7 * * * *
8 * * *
9
10 *
11
12
minterm -->
p.i. 19 20 21 23 24 25 26 27 28 29 30
1
2
3 * * *
4 * *
5 * * *
6 * * * *
7 * * *
8 * * *
9 * * * * * *
10 * * *
11 * * * *
12 * * * * * * *
Minimum Cost Solution:
F = 5+8+10+(2+6+11)(1+4+12)
(parenthesised expressions are alternatives)
Cost = 15 literals