Boolean minimization up to 4 variables
Build a minimum-literal sum-of-products expression from true minterms and optional don’t-care terms.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
Enumerate valid 0/1/− implicants; cover DP minimizes literal count, then term count.
With 3 variables A,B,C, true minterms 1,3,5,7 reduce to C with 1 literal.
Use 1–4 variables with indices 0–2ⁿ−1. The true set must be nonempty and disjoint from don’t-cares. Hardware delay, hazards and multilevel logic are not optimized. Floating-point results display at most 12 significant digits.
Frequently asked questions
What is the bit order of minterm indices?
A is the most significant bit. ! denotes negation, · means AND and + means OR.
Must don’t-care terms evaluate to true?
No. They may be true or false when simplifying; every required true minterm is covered.
Calculation criteria and reference materials
- MIT: combinational logic
Truth tables, sum-of-products expressions and logic simplification.
Verification of calculation criteria: · Calculation·verification principles · Report errors