Digital Logic Design
Boolean Expression Simplifier
Enter any Boolean expression and get the exact minimal SOP and POS — prime implicants, essential implicants, cover selection, and a row-by-row proof that nothing changed but the cost.
About this calculator
Algebraic simplification by hand is a craft of spotting identities — absorption, consensus, De Morgan — and its failure mode is silent: one illegal step and the 'simplified' circuit computes a different function. This tool takes the opposite, mechanical route: your expression is evaluated into its complete truth table, minimized exactly by the Quine–McCluskey tabulation method, and the result is checked back against every row of that table before it is shown. Simplification with a receipt.
The worked solution is the full derivation, not just the answer: the canonical minterm form your expression evaluates to; every prime implicant (each one a maximal combining of adjacent minterms — the algebraic twin of a largest K-map group); which of them are essential because some minterm has no other cover; and how the remainder, if any, was chosen by Petrick's method with a fewest-terms-then-fewest-literals cost. Both minimal forms are reported — sum-of-products for NAND-NAND structures, product-of-sums for NOR-NOR — with literal counts so the saving is a number, not an impression.
Exact two-level minimization is a solved problem at this scale (2–5 variables), which is precisely why it makes a trustworthy reference: whatever your hand derivation produced, comparing it against a provably minimal, provably equivalent form settles the question. When two different-looking minimal answers exist — the cyclic-cover situation — both are genuinely correct, and the interpretation panel says so rather than pretending uniqueness.
Design notes & common mistakes
- The consensus theorem (AB + A'C + BC = AB + A'C) is the identity hand-simplifiers miss most — the redundant BC term is a prime implicant that a minimal cover simply doesn't need.
- Minimal SOP and minimal POS generally have different costs; check both before choosing a NAND-NAND vs NOR-NOR structure.
- Two-level minimality is not overall minimality — XOR-rich functions (parity, adders) resist SOP compression entirely and want XOR gates instead.
- Always simplify against the truth table, not against your last algebraic step — errors compound silently in algebra and never in the table.
Assumptions
- Exact two-level minimization, cost-ordered by product terms then literals.
- The expression defines the function completely (no don't-cares from expression input — enter don't-cares via the K-map solver's minterm mode).
- 2 to 5 variables, A–E.
When to use this calculator
Appropriate for
- Reducing a Boolean expression to exact minimal SOP and POS, verified against its truth table
- Settling whether a hand-simplified expression is truly minimal and equivalent
- Teaching Quine–McCluskey minimization with a full worked derivation
Not suitable for
- Incompletely specified functions — expression input pins every row; use the K-map solver's minterm mode for don't-cares
- Multi-level factoring, which can beat two-level SOP/POS in gate count and is out of scope
- Technology mapping against a specific cell library's cost model
What this calculator does not cover
- Two-level SOP/POS only — multi-level factoring (sharing subterms across gates) can beat it in gate count and is out of scope here.
- No don't-care entry in expression mode — an expression pins every row by definition; use the K-map solver for incompletely specified functions.
- Cost model is terms-then-literals; a technology-specific cost (transistor count, specific cell library) can prefer a different answer.
- As with every calculator on this site: results are preliminary and educational, are not verified for any specific installation, and must be reviewed against the applicable code edition and stamped by a licensed Professional Engineer before real-world use.
Frequently asked questions
How do I know the simplified expression is really equivalent?
It is checked, not assumed: the minimal form is expanded and compared against your expression's truth table on every row, and the confirmation is part of the result. If that check ever failed, you would see an error instead of an answer.
My hand-simplified answer looks different — is it wrong?
Not necessarily. Some functions have several minimal covers of identical cost (the cyclic-cover case). Compare term count and literal count: if both match, your answer is equally minimal; the tool's interpretation panel notes when such a tie exists.
Why does my parity-like expression barely simplify?
XOR functions are maximally distant from SOP structure: every minterm of a parity function is its own prime implicant, so two-level minimization can't compress them. That's not failure — it's the signal to implement with XOR gates.
References
- Mano, M. M. & Ciletti, M., Digital Design, 6th ed. (Boolean algebra, Quine–McCluskey)
- Roth, C. H. & Kinney, L., Fundamentals of Logic Design, 7th ed. (tabular minimization, Petrick's method)
- Quine, W. V., 'The Problem of Simplifying Truth Functions', American Mathematical Monthly 59 (1952)
Related calculators
Karnaugh Map Solver (2–5 Variables)
Click cells or enter minterms and watch the K-map group itself: exact Quine–McCluskey minimization drawn as highlighted groups, with the minimal SOP and POS and a proof of equivalence.
Truth Table Generator
Type a Boolean expression (or a minterm list) and get the complete truth table, the canonical Σm and ΠM forms, and an instant read on tautologies and contradictions.
SOP ↔ POS Converter
One function, both shapes: canonical and minimal sum-of-products and product-of-sums, with the Σm/ΠM complement relationship made explicit on the truth table.
Logic Gate Evaluator
Every standard gate — AND, OR, NOT, NAND, NOR, XOR, XNOR — with its distinctive-shape symbol, live input toggling, full truth table, and what each gate is actually for.
Get the ComputeVerse.ai quick reference
A free engineering quick-reference PDF, plus a note when new calculators launch across the library — one or two emails a month, nothing else.