Combinational Logic Gates

Combinational logic circuits are formed by combining basic logic gates such as AND, OR, and NOT to produce a required output.

The output of a combinational logic circuit depends only on the current input values. It does not depend on previous input values.

This concept is important when analysing digital circuits because a circuit can be designed to produce a specific output for each possible combination of inputs.

What Are Combinational Logic Gates?

A combinational logic circuit is a digital circuit created by connecting logic gates together to perform a required logical operation.

The basic gates used to construct these circuits are:

• AND gate
• OR gate
• NOT gate

By combining these gates, more complex logic operations can be produced. NAND and NOR are examples of gates formed by combining a basic gate with a NOT operation.

Basic logic gates
      ↓
AND + OR + NOT
      ↓
Combined logic operations
      ↓
Required output

Current Inputs and Output

A key characteristic of combinational logic is that the output is determined by the inputs that are present at that moment.

Current inputs
      ↓
Logic operation
      ↓
Current output

Previous input values are not stored and do not determine the next output.

Basic Gates Used to Form Combinational Gates

AND Gate

An AND gate produces an output of 1 only when all inputs are 1.

For two inputs:

Q = A · B

Here, · represents the AND operation.

The AND operation can therefore be remembered as:

AND → all inputs must be 1.

OR Gate

An OR gate produces an output of 1 when at least one input is 1.

For two inputs:

Q = A + B

Here, + represents the OR operation in Boolean algebra.

The OR operation can therefore be remembered as:

OR → at least one input must be 1.

NOT Gate

A NOT gate produces the opposite or complement of its input.

Q = A̅

Therefore:

• If A = 0, then Q = 1
• If A = 1, then Q = 0

The NOT operation can therefore be remembered as:

NOT → opposite value.

NOR Gate

A NOR gate is a combination of an OR gate followed by a NOT gate.

OR gate
   ↓
NOT gate
   ↓
NOR output

Its Boolean expression is:

Q = (A + B)̅

This means:

Q = NOT (A OR B)

How the NOR Gate Works

First, the two inputs are processed by the OR operation. The result is then inverted by the NOT operation.

Therefore, a NOR gate produces an output of 1 only when all inputs are 0.

NOR Truth Table

Notice that the output is 1 only for the input combination 0, 0.

Consider two security sensors. Suppose the required output is 1 only when both sensors are inactive.

Sensor 1 = 0
Sensor 2 = 0
      ↓
     NOR
      ↓
Output = 1

If either sensor becomes active and changes to 1, the NOR output becomes 0.

NAND Gate

A NAND gate is a combination of an AND gate followed by a NOT gate.

AND gate
   ↓
NOT gate
   ↓
NAND output

Its Boolean expression is:

Q = (A · B)̅

This means:

Q = NOT (A AND B)

How the NAND Gate Works

First, the inputs are processed by the AND operation. The result is then inverted by the NOT operation.

Therefore, a NAND gate produces an output of 0 only when all inputs are 1.

NAND Truth Table

Notice that the output is 0 only for the input combination 1, 1.

Imagine a device that should produce an OFF output only when two conditions are simultaneously ON.

Condition A = 1
Condition B = 1
      ↓
     NAND
      ↓
Output = 0

If either condition changes to 0, the NAND output becomes 1.

NAND and NOR Comparison

NAND and NOR are both formed by adding a NOT operation to another basic gate, but their logical behaviour is different.

Truth Table Comparison

A useful memory method is:

NOR  → NOT OR
NAND → NOT AND

Boolean Expressions

The Boolean expressions for the gates in this topic are:

The bar over an expression represents the NOT/complement operation.

Analysing a Combinational Circuit

When an examination question gives a circuit made from several gates, analyse it from the inputs towards the final output.

Use this sequence:

Identify inputs
      ↓
Apply the first gate operation
      ↓
Use that result as the next input
      ↓
Continue through the circuit
      ↓
Find the final output

For example, if an OR gate is followed by a NOT gate:

A, B
 ↓
OR
 ↓
NOT
 ↓
Q

the complete circuit is a NOR gate.

Similarly:

A, B
 ↓
AND
 ↓
NOT
 ↓
Q

is a NAND gate.

Truth Tables in Combinational Logic

A truth table lists all possible combinations of input values and shows the output produced for each combination.

For two binary inputs, the number of possible combinations is:

2² = 4

For three binary inputs:

2³ = 8

Therefore, a circuit with n binary inputs has:

2ⁿ

possible input combinations.

Truth tables are especially useful for checking whether a circuit produces the expected output for every possible input state.

Real-World Applications

Combinational logic is used in many digital systems where outputs must be generated from current input conditions.

Examples include:

• Control circuits
• Alarm systems
• Sensor-based systems
• Digital electronic devices
• Computers and calculators
• Decision-making circuits

Suppose two sensors provide inputs to a logic circuit. The required alarm behaviour can be represented using combinations of AND, OR, and NOT operations.

The sensors provide the current input values, and the logic circuit produces the required output according to those values.

Exam-Focused Points

Quick Revision

• Combinational logic circuits are formed by combining logic gates.
• Basic gates include AND, OR, and NOT.
• A NOR gate is an OR gate followed by a NOT gate.
• A NAND gate is an AND gate followed by a NOT gate.
• NOR output is 1 only when all inputs are 0.
• NAND output is 0 only when all inputs are 1.
• A truth table shows every possible input combination and its output.
• For n binary inputs, there are 2ⁿ possible input combinations.
• The output of combinational logic depends on the current inputs, not previous inputs.

Summary

A combinational logic circuit is produced by combining logic gates to perform a required logical operation. Its output is determined only by the current input values.

The NOR gate combines OR and NOT operations and produces 1 only when all inputs are 0. The NAND gate combines AND and NOT operations and produces 0 only when all inputs are 1.

For examinations, students should be able to identify the gates, write their Boolean expressions, complete their truth tables, and determine the output of a circuit from its current inputs.