Ex-OR and Equivalence functions

& Analyzing a Combinational Circuit

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Ex-OR and Equivalence functions
The exclusive-OR (XOR), denoted by the symbol {, is a
logical operation that performs the following Boolean
operation:

The exclusive-NOR, also known as equivalence, performs

the following Boolean operation:

The exclusive-NOR can be shown to be the complement

of the exclusive-OR by means of a truth table or by
algebraic manipulation:

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Identities and Laws apply to XOR operation

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Odd Function
In particular, the three-variable case can be converted to
a Boolean expression as follows:

Each of these binary numbers has an odd number of 1’s.

In general, an n -variable exclusive-OR function is
an odd function defined as the logical sum of the
2n/2 minterms whose binary numerical values
have an odd number of 1’s.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Logic diagram of Odd and Even Functions

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Four Variable Exclusive OR Function
• Consider now the four-variable exclusive-OR operation.
By algebraic manipulation, we can obtain the sum of
minterms for this function:

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

 Parity Generation and Checking
• Exclusive-OR functions are very useful in systems requiring error
detection and correction codes
• A parity bit is an extra bit included with a binary message to make
the number of 1’s either odd or even.
• The message, including the parity bit, is transmitted and then
checked at the receiving end for errors.
• An error is detected if the checked parity does not correspond with
the one transmitted.
• The circuit that generates the parity bit in the transmitter is called
• a parity generator.
• The circuit that checks the parity in the receiver is called a parity
checker.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT
Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT
Analyzing a Combinational
Circuit

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Procedure for analyzing a circuit
• To obtain the output Boolean functions from a logic diagram,
1. Label all gate outputs that are a function of input variables
with arbitrary symbols— but with meaningful names. Determine
the Boolean functions for each gate output.
2. Label the gates that are a function of input variables and
previously labeled gates with other arbitrary symbols. Find the
Boolean functions for these gates.
3. Repeat the process outlined in step 2 until the outputs of the
circuit are obtained.
4. By repeated substitution of previously defined functions,
obtain the output
Boolean functions in terms of input variables.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Logic Diagram for Analysis example

the circuit has three binary inputs— A , B , and C —and two

binary outputs— F1 and F2.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Boolean Equations

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

• Determine the number of input variables in the circuit.
• For n inputs, form the 2n possible input combinations and list the
binary numbers from 0 to (2n - 1) in a table.
• Label the outputs of selected gates with arbitrary symbols.
• Obtain the truth table for the outputs of those gates which are a
function of the input variables only.
• Proceed to obtain the truth table for the outputs of those gates which
are a function of previously defined values until the columns for all
outputs are determined.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

Finding the logic circuit from the
truth table
• Inspection of the truth table combinations for A, B, C, F1, and F2
shows that it is identical to the truth table of the full adder given
in Section 4.5 for x, y, z, S , and C ,respectively.

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT

References

Prepared By: I. Mala Serene, AP(SG), SCOPE,VIT