A design workflow
A disciplined workflow makes the behaviour testable before hardware is wired.
Turn individual logic gates into useful digital circuits. Translate requirements into truth tables, write Boolean expressions, simplify logic and build a practical half-adder.
A combinational logic circuit produces outputs determined by its present inputs. It has no intentional memory of previous input states. Examples include arithmetic circuits, code converters, selection circuits and simple decision logic.
A disciplined workflow makes the behaviour testable before hardware is wired.
Design habit: write down what the circuit must do in plain language. Identify every input and output, list all input combinations, then derive the logic.
Boolean algebra works with binary variables. A variable can be 0 or 1. The common operators are AND, OR and NOT. In expressions, a bar or prime mark means inversion.
Identity: A · 1 = A; A + 0 = A
Null: A · 0 = 0; A + 1 = 1
Idempotent: A · A = A; A + A = A
Complement: A · A' = 0; A + A' = 1
Double inversion: (A')' = A
Distributive: A(B + C) = AB + AC
De Morgan's theorems are useful when translating a design into NAND-only or NOR-only hardware.
Equivalent Boolean expressions produce the same output for every possible input combination. Simplification can reduce IC count, wiring, power consumption and opportunities for mistakes.
Suppose an output should be HIGH whenever A is HIGH, or whenever both B and C are HIGH.
This expression is already compact. The circuit uses one AND gate feeding one OR gate.
A Karnaugh map groups adjacent 1s to identify a simpler expression. For two variables, arrange the four combinations in a 2 × 2 grid.
| B=0 | B=1 | |
|---|---|---|
| A=0 | m0 | m1 |
| A=1 | m2 | m3 |
Adjacent cells differ in one variable. Larger valid groups usually produce simpler terms. Module 24 uses small examples; larger maps need careful grouping and don't-care handling.
NAND and NOR are called universal gates because either gate type alone can be combined to implement NOT, AND, OR and more complex Boolean functions.
Tie both inputs of a NAND together to make an inverter. Then use De Morgan's theorem to create other functions.
Universal-gate design is useful when a particular logic family or IC stock is limited. It is not always the fastest or smallest implementation.
Selects one of several data inputs and routes it to a single output. A 2:1 MUX implements Y = S'D0 + SD1.
Converts a binary input code into one of several active outputs. Useful for address selection and display control.
Converts an active input line into a binary code. Practical priority encoders resolve cases where more than one input is active.
Adds two one-bit inputs. SUM = A XOR B; CARRY = A AND B. A full adder also accepts a carry-in.
Change A and B to see how different Boolean functions behave. The table is generated from the selected function. This is a logic teaching model, not a transistor-level IC simulator.
AND is HIGH only when both inputs are HIGH.
| A | B | Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
The highlighted row matches the current input states.
A half adder adds two single binary digits. It produces a SUM bit and a CARRY bit. We will build it from one 74HC86 XOR gate and one 74HC08 AND gate, then test all four input combinations.
| A | B | SUM | CARRY |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
SUM = A ⊕ B · CARRY = A · B
When both inputs are 1, binary 1 + 1 produces 10: SUM is 0 and CARRY is 1.
The same two input signals feed both gates. The XOR path generates SUM; the AND path generates CARRY.
Both ICs use the first gate. Their pin 1 and pin 2 inputs receive the same A and B signals. Pin 3 gives the respective output. Both packages are powered separately.
Expected behaviour: no buttons pressed gives SUM off and CARRY off. Press either button alone and SUM lights. Press both together and SUM turns off while CARRY lights. Record all four combinations and compare them with the truth table.
Do not leave CMOS inputs floating. Keep the supply within the exact 74HC device ratings, use local bypass capacitors and disconnect power before changing wiring. The IC outputs drive only the small indicator loads in this experiment; do not connect motors, relays or large loads directly.
Challenge: add a third input and design a circuit that turns on an indicator when at least two of the three inputs are HIGH. Start with a truth table, derive the Boolean expression, simplify it and test every input combination.
Explore these open lessons at your own pace. For personalised explanations, project-specific troubleshooting, guided practical training or masterclasses, EazyLife offers paid support tailored to your learning goals.
Free or sponsored lesson referrals may be available through active programmes; they are not guaranteed.