XOR Gate – Definition, Explanation, Truth Table and Analogy

An XOR, or Exclusive OR gate, is a fundamental digital logic gate that operates on binary inputs and produces a binary output based on the exclusive disjunction (XOR) operation. Let us learn more about XOR logic gate, its truth table and its explanation in our blog.

Definition of XOR: “XOR” is the abbreviation for “Exclusively-OR.” It is a logical operator that performs a specific operation on its input signals, producing a corresponding output signal. The simplest XOR gate is a two-input digital circuit. 

Must Explore – Technology Courses

XOR Gate Truth Table

Here is a simple explanation of the XOR truth table – 

• If both inputs are “0” (same inputs), the output is “0”.
• When one input is “0” and the other is “1” (different inputs), the output is “1”.
• When both inputs are “1” (same inputs), the output is “0”.

XOR Gate Boolean expression 

In Boolean algebra, the XOR operation is also known as the exclusive disjunction. The Boolean expression for an XOR gate can be represented using the “+” symbol to denote the XOR operation.

The XOR gate takes two binary inputs (A and B) and produces a single output (X). The Boolean expression for an XOR gate is as follows:

Q = A ⊕ B

Here’s a breakdown of the expression:

• “Q” represents the output of the XOR gates.
• “A” and “B” are the two input values.

The symbol “⊕” denotes the XOR operation. This operation estimates true (1) when the inputs are different and false (0) when the inputs are the same.

XOR Gates Configurations

There are two main configurations of XOR gates based on the number of inputs:

2-Input XOR gate

The 2-Input Ex-OR gate is the most basic type of XOR gate –

In this truth table:

• “A” and “B” are the two binary input values.
• “Q” represents the XOR gate’s output based on the inputs.

The XOR evaluates to true (1) when the inputs are different and false (0) when the inputs are the same. To understand it better, here is the representation of its evaluation –

0 ⊕ 0 = 0

0 ⊕ 1 = 1

1 ⊕ 0 = 1

1 ⊕ 1 = 0

3-Input XOR gate

A 3-input XOR gate takes three binary inputs and produces a single output. The XOR operation evaluates to true (1) when an odd number of inputs are true (1), and false (0) otherwise. 

The 3-input XOR gate follows the same logic but with three input signals.

The truth table for a 3-input XOR gate is as follows:

In this truth table:

• “A,” “B,” and “C” are the three binary input values.
• “Q” represents the XOR gate’s output based on the inputs.

The XOR operation evaluates to true (1) when an odd number of inputs are true (1). Please note that the “Output” column has a value of 1 when the number of true inputs (1s) is odd and 0 in case the number of true inputs is even.

Analogy: Food Combinations and the XOR Logic Gate

Imagine you want to make some unique food combinations, but you have two ingredients in front of you: chocolate and vanilla ice cream.

• Putting two scoops of chocolate ice cream together is still chocolate ice cream (output: 0). The taste doesn’t change because you used the same ingredient.
• But suppose you take a scoop of chocolate ice cream and a scoop of vanilla ice cream and combine them. In that case, you’ve created something new – a swirl of different and exciting flavours (output: 1). Combining different ingredients results in a new flavour.

Technical inference to the XOR gates:

• The XOR gate is like your food adventure. It takes two inputs, just like the two ice cream flavours.
• If the inputs are the same (both 0 or both 1), the XOR gate’s output is 0. It’s like mixing the same ice cream flavours – you get nothing new.
• But if the inputs are different (one 0 and one 1), the XOR gate’s output is 1. Like mixing chocolate and vanilla ice cream to create a unique taste, the XOR gate combines inputs to create a special result.