❑ Logic gates

▪ Logic gates are the basic building blocks of a digital system.

▪ It is an electronic circuit which works on Boolean algebra.
▪ A gate is a circuit which has one or more inputs but has only one
output.

▪ The input and output signals have only one of the two states high or
low 1 or 0

▪ State 1 represents a high voltage level (say 5 volts ) and state 0

represents a low voltage level ( 0 volts)
❑ AND gate using
Diodes

▪ When A=0 and B=0 both the

diodes conducts and clamp the 5V
output to zero.
▪ When A= 0, B=1 and A=1 ,B=0
1
output is zero.
▪ When A =1 and B = 1 both diodes Output voltage
are off and the output rises to 1
▪ In AND gate output is high only
2
when all the inputs are high.
▪ ( 1→ High , 0 → Low )
❑ Circuit Symbol of AND gate and its Truth table
❑ OR Gate using diodes
▪ When A is at +5 V ( high) D1 is forward
biased and hence conducts. The current
flows through R and the entire voltage 5
V is dropped across it. Therefore 1
potential at the output will be +5V.
▪ Same explanation for D2
▪ When both A and B are at +5V (high)
the drop across R is 5 V and hence 2
potential at the output is 5V (high)
▪ The output remains at 0 V only when
there is no voltage either at A or B
❑ Circuit Symbol and truth Table of OR Gate
 ❑ NOT gate using a
transistor
▪ A not gate is called an
inverter because it inverts
the input signal.
▪ When the input is low the
transistor is cut off and
the output is high.
▪ When the input is high V output
the transistor is in
saturation and the output
is low.
❑ Circuit symbol and truth table
❑ De – Morgan’s theorem

• The first theorem states that the compliment of a sum is equal to the
product of the compliments.
• When two variables are involved the theorem is represented by
A + B = Aഥ . ഥB
• The left side of this equation represents an OR gate followed by an
inverter . This combination is called NOR gate.
• The right side of the De-Morgan’s theorem represents an AND gate
whose inputs are the inverted values of A and B
• NOR gate is called a bubbled AND gate.
❑ Circuit symbol and Truth table of NOR gate.
❑ NOR Gate And Bubbled AND gate
❑ De Morgan’s theorem
❑ De Morgan’s theorem and Truth table
❑ De Morgan’s theorem

De Morgan’s second theorem states that compliment

of a product is equal to the sum of the compliments.
For two variables A and B AB = A ഥ+Bഥ
▪ The left side of the equation is called a NAND gate.
It is an AND gate followed by an inverter
▪ The right side of the equation is a bubbled OR gate.
▪ A NAND gate is equivalent to a bubbled OR gate.
NAND gate and Truth table NAND GATE
❑ De Morgan’s second theorem theorem
❑ De Morgan’s second theorem and Truth table
❑ NAND gate as universal gate
• The NAND gate can be used to built OR gate , AND gate and NOT
gates.
• Hence one can build a logic circuit using NAND gates only
• Thus NAND gate is called a universal building block.

• NOT GATE FROM NAND →

❑ NOT gate from NAND gate
 ❑ AND gate and OR gate from NAND gate.

Y= 𝑨𝑩= AB
𝑨𝑩
𝑨𝑩

ഥ
𝑨

ഥ𝑩
Y=𝑨 ഥ = 𝑨 +𝑩
ന =A+B
ഥ
𝑩
ഥ𝑩
Y=𝑨 ഥ = 𝑨 +𝑩
ന =A+B
❑ XOR Gate ( Exclusive OR gate)

❑ The logic gate whose output is high only when the odd number of
inputs are high is known as XOR gate. It is a special gate which is
used in arithmetic circuits.
❑In Boolean algebra + represents XOR operation.
❑Boolean operation Y = A + B
❑ Boolean expression for XOR gate is Y= A𝐵ഥ + 𝐴ҧ B
 The output of the XOR gate is 1 when the inputs are different and the output is zero
when the inputs are the same. It is called an inequality comparator because the
output is high only when the inputs are different .
❑ PROBLEMS

• 1.
❑ Problem 2
• Write the Boolean equation
❑ Problem 3.
❑ Problem 4.
❑ Problems.5