• 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

 

There are following laws in Boolean algebra:

Associative Law: This law states that if we have 3 variables x, y, z then

X*(Y*Z) = (X*Y)*Z

Commutative Law: This law states that

X*Y = Y*X

Identity element: If e is the identity then we have the relation with the Boolean algebra

e*x = x*e=x Hence 0 is identity for + as x + 0 = x = 0 + x & 1 is for dot(.) as x.1=x=1.x

Compliment: x+x’=1      x.x’=0

Boundedness Law: x+1= 1           x.0=0

Distributive law: Suppose we have two binary operators * and . then this law states that

X+(y.z) = (x+y) .  (x+z)                    x.(y+z)= x.y + x.z

DeMorgan Law:                (x + y)’ = x’. y’                                    (x.y)’ = x’ + y’

This can also be generalized and stated as that whenever we want to take compliment of any function we just have to take compliment of each literal and change AND to OR & OR to AND and 0 to 1 & 1 to 0

(A+B+C+D+E…. +Z)’ = A’ B’ C’ D’ E’ …..Z’

(ABCDE….Z)’ = A’ + B’ + C’ +D’ + E’……+Z’

Absorption law:               x + xy = x                                             x(x+y)=x

 

Elimination law:               x + (x’.y) = x + y                                                x.(x’ + y)=x.y

 

Unique compliment theorem:  If we have x + y =1 and x . y = 0, then x = y’

 


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