Sum-of-Products (SOP) Solver
Get the minimal sum-of-products expression for any Boolean function, from 2 to 6 variables, with the full grouping shown directly on the map.
Why use this sum-of-products (sop) solver
Exact minimization
Uses essential prime implicant extraction plus Petrick's method — not a greedy shortcut — for the true minimal SOP.
Every input mode supported
Enter minterms, a truth table, K-map clicks, or a raw expression — SOP output either way.
See the AND-OR circuit
The auto-generated circuit matches the SOP structure directly: AND gates per term, one OR gate combining them.
Frequently asked questions
What does SOP mean?
Sum-of-products: an expression written as OR'd-together AND terms, e.g. F = AB + A'C — the most common form for implementing a function with AND and OR gates.
Is SOP always the simplest form?
Not always — some functions have a simpler product-of-sums (POS) form instead. Try the POS Solver on the same function to compare.
Does this handle don't-cares in SOP minimization?
Yes, don't-cares are used wherever they help form a larger group, in every input mode.