-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-1.txt
47 lines (32 loc) · 1.23 KB
/
test-1.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
BOOLEAN MINIMISATION V1.0
==========================
Minterms:
0 1 5 7 8 10 14 15
Don't cares:
*** none ***
The function order is 4
Prime Implicants:
p.i. cell literals cost status
1 0,8 -000 3 non-essential
2 0,1 000- 3 non-essential
3 1,5 0-01 3 non-essential
4 5,7 01-1 3 non-essential
5 7,15 -111 3 non-essential
6 8,10 10-0 3 non-essential
7 10,14 1-10 3 non-essential
8 14,15 111- 3 non-essential
Prime Implicant Chart:
minterm -->
p.i. 0 1 5 7 8 10 14 15
1 * *
2 * *
3 * *
4 * *
5 * *
6 * *
7 * *
8 * *
Minimum Cost Solution:
F = (1+3+5+7)(2+4+6+8)
(parenthesised expressions are alternatives)
Cost = 12 literals