Combinational Logic Circuits: Basics

TL;DR

Combinational logic circuits produce outputs based solely on their current inputs, without any memory of past states. They're built from basic logic gates like AND, OR, and NOT, which perform fundamental Boolean operations. Understanding these circuits is crucial for designing digital systems that process information.

1. The Mental Model

Imagine a set of light switches connected in a specific way to a light bulb. The light bulb's state (on or off) depends only on how you flip those switches right now, not on how they were flipped before. That's essentially a combinational circuit.

2. The Core Material

Combinational logic circuits are fundamental building blocks in digital electronics. Their output is a direct function of their current inputs. This means they don't store information or have "memory."

Basic Logic Gates

Photo by Jeswin Thomas on Pexels

The simplest combinational circuits are logic gates, which perform basic Boolean algebra operations. You'll encounter these commonly:

• AND Gate: Output is HIGH (1) only if all inputs are HIGH. Otherwise, it's LOW (0).
  • Symbol: A · B or A AND B
• OR Gate: Output is HIGH if any input is HIGH. It's LOW only if all inputs are LOW.
  • Symbol: A + B or A OR B
• NOT Gate (Inverter): Output is the opposite of the input. If input is HIGH, output is LOW, and vice-versa.
  • Symbol: Ā or NOT A
• NAND Gate: NOT AND. Output is LOW only if all inputs are HIGH.
  • Symbol: (A · B)
• NOR Gate: NOT OR. Output is HIGH only if all inputs are LOW.
  • Symbol: (A + B)
• XOR Gate (Exclusive OR): Output is HIGH if an odd number of inputs are HIGH (meaning inputs are different).
  • Symbol: A ⊕ B
• XNOR Gate (Exclusive NOR): Output is HIGH if an even number of inputs are HIGH (meaning inputs are the same).
  • Symbol: A ⊙ B

Truth Tables

Photo by Ron Lach on Pexels

A truth table is a tabular representation that lists all possible input combinations for a logic circuit and the corresponding output for each combination. It's how you define and verify the behavior of a combinational circuit.

Here's an example for a 2-input AND gate:

Building More Complex Circuits

Photo by Mikhail Nilov on Pexels

You can combine these basic gates to create more complex combinational circuits that perform specific tasks. For example, you can build an adder circuit from AND, OR, and XOR gates. The design process often involves:

1. Defining the circuit's behavior with a truth table.
2. Deriving a Boolean expression from the truth table.
3. Simplifying the Boolean expression (using Boolean algebra or Karnaugh maps) to minimize the number of gates needed.
4. Drawing the logic diagram using gate symbols.

graph TD
    A["Input A"] --> AND1
    B["Input B"] --> AND1
    AND1["AND Gate"] --> OR1
    C["Input C"] --> OR1
    OR1["OR Gate"] --> Output["Output F"]

The diagram above shows a simple combinational circuit where F = (A AND B) OR C. The output F depends directly on the current states of inputs A, B, and C.

3. Worked Example

Let's design a combinational circuit for a simple voting system where there are three voters (A, B, C) and the output (X) is 1 (vote passes) if at least two voters say "yes" (input is 1).

1. Truth Table:

   A	B	C	X (Output)
   0	0	0	0
   0	0	1	0
   0	1	0	0
   0	1	1	1
   1	0	0	0
   1	0	1	1
   1	1	0	1
   1	1	1	1

2. Boolean Expression (from rows where X=1):
   X = (NOT A AND B AND C) OR (A AND NOT B AND C) OR (A AND B AND NOT C) OR (A AND B AND C)

3. Simplification (using Boolean algebra):
   You can simplify this expression. For instance, notice (A AND B AND NOT C) and (A AND B AND C) can be combined to (A AND B). Applying this logic:
   X = (B AND C) OR (A AND C) OR (A AND B)

4. Logic Diagram (conceptual):
   This simplified expression would be implemented using three 2-input AND gates (for B AND C, A AND C, A AND B) whose outputs feed into a 3-input OR gate.

4. Key Takeaways

• Combinational circuits' outputs are determined only by their current inputs.
• They have no memory elements and don't depend on past input history.
• Basic logic gates (AND, OR, NOT, etc.) are the building blocks.
• Truth tables completely define the behavior of a combinational circuit.
• Complex combinational circuits are designed by combining and simplifying Boolean expressions of basic gates.
• These circuits are essential for tasks like arithmetic, data selection, and code conversion.

Common Mistakes to Avoid:
- Don't confuse combinational circuits with sequential circuits; sequential circuits do have memory.
- Don't assume an output will stay the same if inputs change; it updates immediately.
- Forgetting to simplify Boolean expressions can lead to overly complex and inefficient designs.
- Misinterpreting truth table entries will lead to incorrect circuit design.

5. Now Try It

Design a combinational circuit that takes two 1-bit binary inputs (A and B) and produces two outputs: Sum (S) and Carry (C). This is called a Half Adder.

What to do:
1. Draw the truth table for this Half Adder, showing all possible combinations of A and B, and their corresponding S and C outputs.
2. From the truth table, write the Boolean expressions for S and C.
3. Draw the logic diagram for the Half Adder using basic logic gates (AND, OR, XOR, NOT).

What success looks like:
You'll have a truth table, two simplified Boolean expressions (one for S, one for C), and a clear logic diagram showing which gates are used and how they're connected to produce the Sum and Carry outputs.