• Home
  • Tutorials
  • Interviews
  • Info Seed
  • Forums
  • Projects
  • Links
  • Contact Us
Digital Electronics
NUMBER SYSTEM
BINARY CODES
BOOLEAN ALGEBRA
BINARY LOGIC
LOGIC GATES
BOOLEAN ALGEBRA LAWS
CONSENSUS THEOREM
DIFFERENT FORS OF BOOLEAN EQUATIONS
RELATION B/W MAX & MIN TERMS
16 type of LOGIC FUNCTIONS
AND & OR GATE
Other GATES
XOR & XNOR gates
NEGATED & COMPLIMENTRY GATES
TRISTATE gates & DIP
Illustration of NEGATIVE & POSITIVE LOGIC
Relation B/W XOR & XNOR gates
UNIVERSAL GATES
Implementation of XOR using minimum gates
Implementation of XNOR using minimum gates
Different levels of CIRCUIT
Special Characteristics of an IC
QUESTIONS
Q1 (Timing Diagram)
Q2 (Timing Diagram)
Q3 (Timing Diagram - DIfferent units)
Q4 (Timing Diagram)
Q5 (Output of Series of NOR gate )
Q6 (Output of combination of XOR )
Q7 (Circuit of NAND gates & diff delays)
K MAPS
COMBINATIONAL CKT
SEQUENTIAL CIRCUITS
TIMING CIRCUITS

 

 

 

Relation between XOR and X-NOR gates:

As exclusive or gate gives 1 when input variables have odd number of 1’s and equivalence gate gives 1 when there are even number of zeros in input variables

So when we have 2 variables then exclusive or gate gives 1 for x=0, y=1 & x=1, y=0 and it gives 0 for x=0, y=0 & x=1, y=1 while for equivalence gate we have 0 for x=0, y=1 & x=1, y=0 and it gives 1 for x=0, y=0 & x=1, y=1 as shown in the truth tables shown above. So from here we can see that Equivalence operation is compliment of Exclusive OR gate for 2 variables which can also be proved as follow:

A XOR B = A’B + AB’

COMPLIMENT OF A xor B = (A XOR B)’ = (A’B + AB’)’ = (A + B’) (A’ + B) = AA’ + AB + A’B’ + BB’ = AB + A’B’ = A XNOR B

Hence (A’B + AB’)’ = AB + A’B’

This gives (AB)’ =AB

When we have 3 variables we’ll have the following truth tables for equivalence gate and exclusive or gate:


previous next
| Copyright © 2009 exploreroots- All Rights Reserved | Disclaimer |