LOGICS / Bench 01

Gate Bench

Type an expression. Watch it become a circuit.

Gate Bench is where every LOGICS design starts. Write a Boolean function the way you would on paper, and its truth table, K-map and minimized schematic appear beside it, updating live as you edit. Then convert to NAND-only or NOR-only, compare the cost, and lay the gates out on a drag-and-drop canvas.

Free with an account. Expression, truth table and K-map are unlimited.

GATE BENCH
Truth table
ABCF
0000
0011
0100
0111
1000
1011
1101
1111
K-map A\BC 00011110 01 0110 0111
Schematic ABC F
Minimized F = AB + C 2 gates · 3 literals
How it works

From expression to schematic in four moves.

01

Write the expression

Type the function as you'd write it on paper — a sum of products like A'B'C + ABC. Every other view builds from it.

02

Read the truth table

All 2ⁿ input combinations are listed with their output, so you can check the function row by row.

03

Minimize on the K-map

Adjacent 1s are grouped into the largest blocks possible. Each block becomes one product term in the simplified form.

04

Get the schematic

The minimized expression is drawn as gates — ready to convert, count, and move onto the canvas.

Conversions

One function, three forms.

NAND and NOR are universal gates: any circuit can be built from just one of them. On a breadboard that can mean a single chip type instead of several. Gate Bench does the conversion and counts the gates, so you see the trade-off before you build.

FormExpressionGatesChips needed
AND / ORF = AB + C274LS08 + 74LS32
NAND-onlyF = ((AB)' · C')'31 × 74LS00
NOR-onlyF = (((A'+B')' + C)')'52 × 74LS02

Everything on the bench.

Live views

Truth table, K-map and schematic stay in step with your expression as you type.

Simplification

Get the minimized form of your function, alongside the K-map groups that produced it.

NAND-only conversion

Rebuild any function from NAND gates alone, with the new gate count shown beside the original.

NOR-only conversion

Rebuild it from NOR gates alone and compare the cost against the other two forms.

Gate and literal counts

See the cost of each form at a glance, so "simpler" always has a number attached.

Drag-and-drop canvas

Place and wire gates by hand to test an idea or match the diagram in your lab sheet.

Free to use. Pro when your circuits grow.

Free

Expression, truth table and K-map — unlimited.

Canvas up to 6 gates.

Pro

Unlimited canvas.

Limits bite on add, never on keep — a bigger design you already have still opens and works.

See all plans →
Next bench · 02 Problem Forge →

When you'd rather be tested than taught.

Open Gate Bench