Digital Logic Design

Combinational logic and number systems on a provably-correct engine: an interactive Karnaugh map solver (2–5 variables, don't-cares, exact Quine–McCluskey groupings), Boolean expression simplification to verified minimal SOP and POS, truth-table generation with editable cells, SOP↔POS conversion, the standard gates with their distinctive-shape symbols, base/BCD/Gray/two's-complement/ASCII conversion with worked steps, and the flip-flop characteristic and excitation tables. Every minimized expression is checked back against its source truth table before it is shown — a simplification here always comes with its proof of equivalence. Sequential logic and timing analysis are planned follow-on batches.

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.

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.

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.

Number System Converter

Binary, decimal, hex, octal — plus BCD, Gray code, ASCII, and two's-complement encoding/decoding — with the repeated-division and positional-expansion steps written out.

Flip-Flop Characteristic & Excitation Tables

SR, JK, D, and T flip-flops as tables: the characteristic table (what Q⁺ will be) and the excitation table (what inputs force a wanted transition), with a live next-state evaluation.