• 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

 

 

 

XOR:

It is also called exclusive OR gate. It is an odd function. In general, it is equal to 1 if input variables have odd number of 1’s. For 2 variable it is defined as z=x’y+xy’. We don’t have muti input XOR gates because it is quiet uneconomical from hardware point of view. It is represented by which is actually a plus sign enclosed in a circle.

X-NOR: It is also called exclusive NOR gate or equivalence gate. It is an even function. In general, it is equal to 1 if input variables have even number of 0’s (don’t take it as even number of 1’s) . For 2 variables it is defined as z= xy+x’y’. It is represented by which is actually a dot (.) enclosed in a circle.

 

 


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