Logic gates are the foundational building blocks of digital electronic circuits, enabling the processing of binary signals essential to all modern electronic devices. Mastery of logic gates and Boolean algebra is critical for electronics engineers designing and troubleshooting digital systems such as microcontrollers, communication devices, and control systems used across Kenyan industries. This chapter focuses on the application of basic logic gates and Boolean algebra concepts, emphasizing practical problem-solving through worked examples relevant to engineering scenarios in Kenya.

3.1 Basic Logic Gates

Basic logic gates perform fundamental binary operations on one or more input signals to produce a single output. Understanding their operation and how to apply Boolean algebra to simplify logical expressions is essential for designing efficient digital circuits in sectors such as telecommunications, manufacturing automation, and embedded systems development.

3.1.1 AND Gate Operation and Calculations

The AND gate outputs a logic HIGH (1) only when all its inputs are HIGH; otherwise, the output is LOW (0). The Boolean expression for a two-input AND gate is Y = A · B. This operation is represented mathematically as:

$$ Y = A \times B $$

where \(A\) and \(B\) are inputs taking values 0 or 1, and \(Y\) is the output.

Worked Examples

Example 1: An automated irrigation controller activates a pump only when two sensors detect sufficient soil moisture and water availability. If sensor A output is 1 and sensor B output is 0, determine the pump activation signal.

Given: \(A=1\), \(B=0\)

$$ Y = A \times B $$

$$ Y = 1 \times 0 $$

$$ Y = 0 $$

Answer: Pump activation signal = 0 (Pump OFF)

Example 2: In a security system, two switches must be simultaneously ON to trigger an alarm. If \(A=1\) and \(B=1\), find the alarm signal.

Given: \(A=1\), \(B=1\)

$$ Y = A \times B $$

$$ Y = 1 \times 1 $$

$$ Y = 1 $$

Answer: Alarm signal = 1 (Alarm ON)

Example 3: A digital counter reset requires three conditions: \(A=1\), \(B=1\), and \(C=0\). Compute the three-input AND gate output.

Given: \(A=1\), \(B=1\), \(C=0\)

$$ Y = A \times B \times C $$

$$ Y = 1 \times 1 \times 0 $$

$$ Y = 0 $$

Answer: Counter reset signal = 0 (No reset)

3.1.2 OR Gate Operation and Calculations

The OR gate outputs a logic HIGH (1) if at least one input is HIGH. The Boolean expression for a two-input OR gate is Y = A + B, where "+" denotes the logical OR operation:

$$ Y = A + B $$

Worked Examples

Example 1: A hospital alarm system activates if either the fire alarm sensor (\(A\)) or the gas leak sensor (\(B\)) detects danger. If \(A=0\), \(B=1\), determine if the alarm sounds.

Given: \(A=0\), \(B=1\)

$$ Y = A + B $$

$$ Y = 0 + 1 $$

$$ Y = 1 $$

Answer: Alarm signal = 1 (Alarm ON)

Example 2: In a retail store, a door sensor (\(A\)) or a motion sensor (\(B\)) can trigger the security camera. If both sensors are inactive (\(A=0\), \(B=0\)), find the output.

Given: \(A=0\), \(B=0\)

$$ Y = A + B $$

$$ Y = 0 + 0 $$

$$ Y = 0 $$

Answer: Security camera trigger = 0 (No activation)

Example 3: A factory conveyor belt stops if any of three emergency stop buttons (\(A\), \(B\), or \(C\)) is pressed. If \(A=0\), \(B=1\), \(C=0\), determine the stop signal.

Given: \(A=0\), \(B=1\), \(C=0\)

$$ Y = A + B + C $$

$$ Y = 0 + 1 + 0 $$

$$ Y = 1 $$

Answer: Conveyor stop signal = 1 (Stop activated)

3.1.3 NOT Gate Operation and Calculations

The NOT gate, or inverter, outputs the complement of its input. If the input is HIGH (1), the output is LOW (0), and vice versa. The Boolean expression is:

$$ Y = \overline{A} $$

where \(\overline{A}\) denotes the logical NOT of \(A\).

Worked Examples

Example 1: A temperature alarm activates when a sensor output is LOW (0). If the sensor output \(A=1\), find the alarm signal.

Given: \(A=1\)

$$ Y = \overline{A} $$

$$ Y = \overline{1} = 0 $$

Answer: Alarm signal = 0 (No alarm)

Example 2: A digital logic circuit requires the inverted signal of \(A=0\). Find the output.

Given: \(A=0\)

$$ Y = \overline{A} $$

$$ Y = \overline{0} = 1 $$

Answer: Output = 1

Example 3: In a light control system, the NOT gate output activates a relay when the input \(A=1\). Determine the relay control signal.

Given: \(A=1\)

$$ Y = \overline{A} $$

$$ Y = \overline{1} = 0 $$

Answer: Relay control = 0 (Relay OFF)

3.1.4 NAND and NOR Gates: Combined Operations and Calculations

NAND and NOR gates are universal gates used extensively in digital design. The NAND gate outputs LOW only when all inputs are HIGH; otherwise, it outputs HIGH. The NOR gate outputs HIGH only when all inputs are LOW; otherwise, it outputs LOW.

NAND gate Boolean expression for two inputs:

$$ Y = \overline{A \times B} $$

NOR gate Boolean expression for two inputs:

$$ Y = \overline{A + B} $$

Worked Examples

Example 1 (NAND): A control system uses a NAND gate to activate a signal only when both inputs \(A=1\), \(B=1\) are not simultaneously HIGH. Find the output.

Given: \(A=1\), \(B=1\)

$$ Y = \overline{A \times B} $$

$$ Y = \overline{1 \times 1} = \overline{1} $$

$$ Y = 0 $$

Answer: Output = 0

Example 2 (NAND): If \(A=0\), \(B=1\), calculate the NAND output.

Given: \(A=0\), \(B=1\)

$$ Y = \overline{A \times B} $$

$$ Y = \overline{0 \times 1} = \overline{0} $$

$$ Y = 1 $$

Answer: Output = 1

Example 3 (NOR): A signaling circuit uses a NOR gate to output HIGH only when both inputs \(A=0\), \(B=0\). Find the output.

Given: \(A=0\), \(B=0\)

$$ Y = \overline{A + B} $$

$$ Y = \overline{0 + 0} = \overline{0} $$

$$ Y = 1 $$

Answer: Output = 1

Example 4 (NOR): If \(A=1\), \(B=0\), determine the NOR output.

Given: \(A=1\), \(B=0\)

$$ Y = \overline{A + B} $$

$$ Y = \overline{1 + 0} = \overline{1} $$

$$ Y = 0 $$

Answer: Output = 0

Example 5 (NAND with three inputs): In a manufacturing line, a NAND gate with inputs \(A=1\), \(B=1\), and \(C=0\) controls a safety lock. Calculate the output.

Given: \(A=1\), \(B=1\), \(C=0\)

$$ Y = \overline{A \times B \times C} $$

$$ Y = \overline{1 \times 1 \times 0} = \overline{0} $$

$$ Y = 1 $$

Answer: Safety lock control = 1 (Unlocked)

Chapter Summary

This chapter introduced the fundamental basic logic gates such as AND, OR, and NOT, explaining their functions and truth tables. It then explored universal logic gates, NAND and NOR, highlighting their ability to implement any logical function. The discussion proceeded to special purpose gates like XOR and XNOR, which are essential for specific digital operations. The chapter covered the laws of Boolean algebra, providing the foundational rules used to manipulate and simplify logic expressions. Techniques for logic expressions simplification were demonstrated to reduce circuit complexity and improve efficiency. Finally, the chapter presented Karnaugh Maps (K-Maps) as a powerful graphical method for minimizing Boolean expressions, reinforcing the simplification process with practical problem-solving tools.