-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-7.txt
49 lines (34 loc) · 1.48 KB
/
test-7.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
BOOLEAN MINIMISATION V1.0
==========================
Minterms:
1 2 3 5 7 11 13 17 19 23 29 31
Don't cares:
*** none ***
The function order is 5
Prime Implicants:
p.i. cell literals cost status
1 1,19 -00-1 3 essential
2 1,7 00--1 3 non-essential
3 2,3 0001- 4 essential
4 3,23 -0-11 3 non-essential
5 3,11 0-011 4 essential
6 5,13 0-101 4 non-essential
7 13,29 -1101 4 non-essential
8 23,31 1-111 4 non-essential
9 29,31 111-1 4 non-essential
Prime Implicant Chart:
minterm -->
p.i. 1 2 3 5 7 11 13 17 19 23 29 31
1 * * * *
2 * * * *
3 * *
4 * * * *
5 * *
6 * *
7 * *
8 * *
9 * *
Minimum Cost Solution:
F = 1+3+5+(2+7+8)(4+6+9)
(parenthesised expressions are alternatives)
Cost = 22 literals