Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
21 views9 pages

Lecture 7 (XOR-XNOR Gates - FunctionSimplification)

This lecture covers exclusive-OR and exclusive-NOR gates. It includes their truth tables, symbols, NAND gate implementation of exclusive-OR, and properties of exclusive-OR. Examples are provided to demonstrate simplifying algebraic expressions using properties of exclusive-OR, including commutativity and associativity.

Uploaded by

sd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views9 pages

Lecture 7 (XOR-XNOR Gates - FunctionSimplification)

This lecture covers exclusive-OR and exclusive-NOR gates. It includes their truth tables, symbols, NAND gate implementation of exclusive-OR, and properties of exclusive-OR. Examples are provided to demonstrate simplifying algebraic expressions using properties of exclusive-OR, including commutativity and associativity.

Uploaded by

sd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Lecture 7

Exclusive-OR Gate, Exclusive-Nor Gate


In this lecture we will cover the
following:
Truth Tables for Exclusive-OR
Today’s and Exclusive-NOR gates
Topics Symbols for Exclusive-OR gate
and Exclusive-NOR gates
NAND gate implementation of
Exclusive-OR
Properties of Exclusive-OR
Simplification of Algebraic
Expressions

2
Truth Tables for Exclusive-OR and Exclusive-NOR
The truth table for Exclusive-OR gates
gate is as shown:
This truth table shows that Exclusive-OR
gives 1 when either of the inputs is 1 and
gives 0 if both inputs are 0 or both are 1.
So, its expression is: a ⊕ b = a’b + ab’
The truth table for Exclusive-NOR gate is
as shown:
This truth table shows that Exclusive-NOR
gives 1 when both inputs are 0 or both inputs are 1.
So, its expression is: (a ⊕ b)’ = a’b’ + ab

3
Symbols for Exclusive-OR and Exclusive-NOR gates
The symbols for Exclusive-OR and Exclusive-NOR gates are as follows:

Exclusive-NOR gate is sometimes referred to as Comparator.

4
Properties of Exclusive-OR
Some useful properties of Exclusive-OR are:

Commutative

Associativity

5
Simplification of Algebraic Expressions
• If a Boolean function is given in one of the two standard forms: Sum of Minterms
or Product of Maxterms, the following rules are commonly used.

• If the function is stated in other than one of the standard forms, the
following properties are useful.

6
Example 1
Simplify the function following functions:
f = xyz + x’y + x’y’
     Solution:
         

7
Example 2
f = wx + wxy + w’yz + w’y’z + w’xyz’
Solution:
f = wx + wxy + w’yz + w’y’z + w’xyz’
= wx.(1+y)+ w’z.(y+y’) + w’xyz’ (As 1+y =1 and y + y’=1)
= wx + w’z + w’xyz’ = wx + w’ (z + xyz’)
= wx + w’ (z + xy)(z + z’) (As z + z’ =1)
= wx + w’(z + xy)
= wx + w’z + w’xy = w’z + wx + w’xy
= w’z + x.(w + w’y) (As w + w’y = (w +w’)(w + y))
= w’z + x.(w + w’)(w + y) (As w +w’ = 1)
= w’z + x.(w + y) = w’z + wx + xy

8
Examples
• Simplify the function F = (x+y)(x+y+z’) + y’
Solution:
F = (x+y)(x+y+z’) + y’
= (x+y+0)(x+y+z’) + y’ [Or use P12b]
= (x+y+(0.z’)) + y’ = (x+y+0) + y’ = x + y + y’
=x+1=1

• Simplify the function F = (a+b’+c)(a’+b’+c)


Solution:

You might also like