Exclusive OR and Equivalence

functions
 Exclusive OR and Equivalence functions

• EX – OR
– Boolean Operation:
– Equal to 1 only x = 1 or y = 1.
• Ex – NOR or equivalence function:
– Boolean Operation:
– Equal to 1 when both x and y are equal to 1 or both equal
to 0.
• Ex – Or and Ex – Nor can be shown to be
complement to each other by truth table or algebraic
manipulation
EX – OR Implementations
1. Identities that apply to Ex - or

2. It is Commutative and associative

 3. Odd Function
• When there are n variables in Ex-OR
operation, then function is 1 when odd
number of variables are 1.
• Multi-variable exclusive or operation is
defined as an odd function
• Logical sum of the 2n/2 minterms whose
binary numerical values have odd number of
1’s.
4. N-Variable equivalence expression is equal to even
number of Zeros
5. If the number of variables in a function is odd the
minterm with an even number of zeros are same as
the minterms with odd number of ones.
6. Exclusive –OR and equivalence expressions are equal
when both have the same odd number of variables.
7. Minterms of a function with odd number of variables
have an even number of ones. The function can be
expressed as a complement of X-OR or Equivalence
8. It is used for error detection and correction.
Some important inequalities

( A  B  C )  A  B  C
( A  B  C )  A  B  C
( A  B  C)  ( A  B  C)
A  B C  A B  C
 Parity generation
• The circuit that generates the parity bit in the
transmitter is called a parity generator.
 Parity checker
• The circuit that checks the
parity in the receiver is called
a parity checker
• The parity checker can be
implemented with exclusive
or gates:

4 – bit even parity checker

 References
• M. Morris Mano, “Digital Design”, 3rd Edition
• M. Morris Mano, “Digital Logic and Computer
Design”, prentice hall, 2006