From truth table to minimal circuit
A combinational logic output depends only on the current inputs. This chain turns "what function do I want" step by step into "implement it with the fewest gates" — use the five tools in order, and each step's output feeds straight into the next.
Start with step one →- 1Number Base Converter Build the foundation
Start by seeing your data clearly across binary / decimal / hexadecimal — all digital logic is built on binary representation.
Open tool → - 2Truth Table Generator Define the function
Write a Boolean expression (supports AND/OR/NOT/XOR, apostrophe for negation, juxtaposition for AND) and get the full truth table instantly — express exactly what function you want.
Open tool → - 3Karnaugh Map Solver Graphical simplification
Light up the cells where the truth table outputs 1, and the tool uses Quine–McCluskey to automatically circle the minimal sum-of-products — the simplification method most often used for hand-designing circuits.
Open tool → - 4Boolean Algebra Simplifier Algebraic simplification
Don't want to draw cells? Just drop the expression in and use QM + Petrick's method to find the form with the fewest literals — cross-checking against the Karnaugh map result.
Open tool → - 5Minterm / Maxterm Expander Canonical cross-check
Expand the expression into the canonical Σm (sum of minterms) and ΠM (product of maxterms), whose indices map one-to-one onto the Karnaugh map cells — closing the loop across all four tools.
Open tool →
Done with this one? Check out the other track →
Sequential Logic series: flip-flop → state machine