Simplify the Boolean expression
using the laws of Boolean algebra.
List the minterms before touching the algebra. Reading as a 4-bit number (with the most significant bit and a primed literal meaning ), the eight products are
Having the index list makes it possible to verify the final answer instead of trusting the manipulation.
Combine pairs that differ in exactly one literal. The only rule doing real work is applied after factoring. For example
and
Reuse minterms — this is the step that is usually skipped. Idempotence, , lets a minterm appear in more than one grouping at no cost. Duplicating and produces two more three-literal terms:
Stopping at the first pairing leaves and at four literals each, which is why the "obvious" grouping is not minimal.
Handle the two minterms with no neighbour. and differ from every other listed minterm in more than one bit, so neither can be combined. They survive as essential prime implicants in full four-literal form.
Assemble the minimal sum of products.
Six product terms, 20 literals in total. (An equally minimal alternative swaps for ; both cover , so the minimum is not unique.)
Verify by exhaustive evaluation, not by inspection. Evaluating the simplified expression over all assignments of gives exactly on — the same set as the original. Every one of the eight original minterms is covered and no extra row turns on, so the two expressions are equal.
Need to solve a different problem like this? Open the solver →