Lessons and the learning game

Combinational logic design

From a truth table to a working circuit: Boolean algebra, Karnaugh maps, decoders, multiplexers and comparators, ending in a 7-segment decoder.

The benches

The gate lessons use the logic parts of From gates to a computer: bit switches, gates and lamps, which need no power. Pressing Check on a truth-table step drives the switches through every row and reads the lamps by their labels, so a step passes only when every row is right. The chip lessons use 74HC parts at 5 V and check their own readings: the 74HC138's selected line, the 74HC85's verdict, the display's lit segments.

Take the course Combinational logic design on /learn.

The lessons

  1. Truth tables to equations: XOR as A'B + AB' from NOT, AND and OR, the same as one XOR gate, then a half adder.
  2. Boolean algebra: the laws, a two-way MUX from its equation, and the same MUX from four NAND gates by De Morgan.
  3. Karnaugh maps: a full adder's carry from three circled pairs, and a checkerboard sum that only XOR can shrink.
  4. Decoders and encoders: a 74HC138 selecting one line of eight, and a 2-to-4 decoder finished from gates.
  5. MUX as logic: two 74HC151s wired from the truth table's output columns make a full adder with no gates.
  6. Comparators: a 74HC85 saying greater or less, and XOR as a 1-bit difference detector.
  7. Boss: a 7-segment decoder: digits 0 to 3 from a 74HC138, one NAND package and one inverter, then a decimal point for odd digits.

What is simplified

The unpowered logic parts are ideal gates with no delay or loading; the next course, Logic families and buses, is about what real chips add. In the boss, the segments are driven by 74HC chips rather than the logic parts, so every signal is the same family.

Before and after

The course builds on From gates to a computer and Digital logic and memory, and pairs with Sequential logic design, which adds memory.