EXOR Gate
An EXOR gate (also known as Exclusive OR) is just another name for a XOR gate, however GCSE students usually do not know this, and therefore it makes a very good question to trip them. In this example, we use two NOT gates, two AND gates, and an OR gate. Although you might not be familiar with this implementation, the Boolean algebra actually simplifies to an XOR formula, and therefore it is worth remembering this other way of making the same function.
XOR Gate Truth Table for 2 Inputs
| B | A | C | D | E | F | Q |
| 0 | 0 | 1 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 0 | 0 | 0 |
Boolean Implementation of EXOR
As you can surmise, the outputs C and D from the NOT gates is simply a result of inverting their inputs A and B.
The expressions for E and F from the AND gates is simply an AND function of their inputs.
We get the result Q by simple substitution of the previous expressions.
This Article Continues...
Boolean AlgebraDe Morgan's Theorem
XOR Gate
EXOR Gate
XNOR Gate
Example 1 Questions and Answers
Example 2 Questions and Answers