Digital logic tools
Nine calculators for the things you actually have to work out: truth tables, simplification, Karnaugh maps, canonical forms, universal gates, gate diagrams, printable worksheets, fixed width binary and Gray code. All free, all in your browser, nothing uploaded.
The tools
Truth table generator
Type an expression, or several for a multi-output circuit, and get the full truth table, plus the tables of all seven basic gates.
Open →Boolean algebra calculator
Simplify to an irredundant sum of products, or check whether two expressions are equivalent.
Open →Karnaugh map solver
Draws the K-map with every group highlighted, for two to six variables.
Open →Sum of products calculator
Minterms, maxterms, and all four forms: canonical and minimal, SOP and POS.
Open →NAND and NOR converter
Rewrite any expression using only NAND gates, or only NOR gates, with the gate count.
Open →Circuit diagram generator
Draws one expression, or several outputs at once, as a gate diagram you can click through, with live signal colours.
Open →Worksheet generator
A printable set of questions with an answer key, rebuilt from the number in the link.
Open →Binary converter
Decimal, binary, hex and octal at a fixed width, with two's complement and BCD.
Open →Gray code converter
Convert between binary and Gray code, with the full sequence for any width.
Open →Which one do I want?
| If you have | And you want | Use |
|---|---|---|
| An expression | every input combination listed | Truth table generator |
| A long expression | the shortest equivalent | Boolean algebra calculator |
| Two expressions | to know whether they match | Boolean algebra calculator |
| A homework K-map | the groups drawn and named | Karnaugh map solver |
| A truth table | minterms, maxterms, SOP or POS | Sum of products calculator |
| A circuit design | it rebuilt from one gate type | NAND and NOR converter |
| A counter or encoder | a one-bit-at-a-time sequence | Gray code converter |
| A number | it in another base, or in two's complement | Binary converter |
| A class to teach | a printable question sheet with answers | Worksheet generator |
| An idea | to build and run it | The simulator |
The expression tools share one engine
The same parser and minimiser sits behind every tool here that takes an expression, so what you type into one means exactly the same thing in the next. (The binary and Gray code converters work on bit patterns rather than expressions, so they are their own thing.) It accepts whichever notation you use — a·b, a&b, a∧b, ab — and the simplification is Quine-McCluskey, the same algorithm whether you see it as algebra or as groups on a map.