Home Online minimization of boolean functions Tweet
a | b | c | d | Output |
---|---|---|---|---|
0 | 0 | 0 | 0 | 0 |
0 | 0 | 0 | 1 | 0 |
0 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 1 |
0 | 1 | 1 | 0 | 1 |
0 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 1 |
1 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 0 |
Some minimal forms exist.
Minimal Form (with ~) =
a~bc + a~cd + bc~d + ~abd
ac~d + a~bd + ~abc + b~cd
Minimal Form (with overline) =
abc + acd + bcd + abd
acd + abd + abc + bcd
cd | cd | cd | cd | |
---|---|---|---|---|
ab | 0 | 0 | 0 | 0 |
ab | 0 | 1 | 1 | 1 |
ab | 0 | 1 | 0 | 1 |
ab | 0 | 1 | 1 | 1 |