This topic is useful for KTU Regulation 2019 1. EET206 Digital Electronics ( ELECTRICAL AND ELECTRONICS ENGINEERING) 2. CST203 Logic System Design ( COMPUTER SCIENCE ENGINEERING) 3. ECT203 Logic Circuit Design (ELECTRONICS AND COMMUNICATION ENGINEERING) 4. EBT205 Logic Circuit and Design (BIOMEDICAL ENGINEERING) 5. ITT203 Logic System Design (INFORMATION TECHNOLOGY) 6. ECT203 Logic Circuit Design (APPLIED ELECTRONICS ENGINEERING) KTU Regulation 2015 1. EE204 Digital Electronics and Logic Design (ELECTRICAL AND ELECTRONICS ENGINEERING) 2. CS203 Switching Theory and Logic Design (COMPUTER SCIENCE ENGINEERING) 3. EC207 Logic Circuit Design (ELECTRONICS AND COMMUNICATION ENGINEERING) 4. EC207 Logic Circuit Design (APPLIED ELECTRONICS ENGINEERING AND INSTRUMENTATION) 5. IC207 Design of Logic Circuit (BIOMEDICAL ENGINEERING) FOR FULL CLASSES : https://youtube.com/playlist?list=PL2UV2EJdMQmgLuA8dwLY7-4DsbNQTsUOg #digitalelectronics#ktu#eee#electrical#cse FOR FULL CLASSES : https://youtube.com/playlist?list=PL2UV2EJdMQmgLuA8dwLY7-4DsbNQTsUOg #digitalelectronics#ktu#eee#electrical
hello students, today we are going to discuss about logic gates
what is a logic gate?
it is a physical device which performs logic operations
on one or more logical input and produces a single logic output
logic gates are the devices which perform logical operations
we know that logic operations are in the terms of zeros and ones
logic gates are the building blocks of a digital system
they can be used to implement logic expression
logic 1 means on state or high
logic 0 means off state or low
suppose the on state of a 5 volt device is 1
1 means 5 volts
5 volts is presently going
logic 0 means 0 volts
what is the definition of logic gate?
logic gate is a physical device
it is logic output
this is the definition of logic gate
we can categorize logic gates into 3 groups
basic gate
universal gate
arithmetic gate
we can categorize logic gates into 3 groups
basic gate, universal gate and arithmetic gate
what is a basic gate?
or which are the gates coming under the basic gate?
the gates coming under the basic gate are
first one is NOT gate
second one is OR gate
third one is AND gate
the gates coming under the basic gate are NOT gate, OR gate and AND gate
second one is universal gate
there are only two universal gates
first one is NAND gate
second one is NOR gate
what are the universal gates?
NAND gate and NOR gate
it is always asked in exams
arithmetic gate
the gates coming under the arithmetic gate are
XOR gate
second one is XNOR gate
what are the gates coming under the arithmetic gate?
XOR gate and XNOR gate
let's discuss the gates coming under the basic gate
what are the gates coming under the basic gate?
NOT gate
the logic symbol of NOT gate is
LOGIC SYMBOL
there is only one input
what is the input?
it is the complement of the input
if input is 1, the output is 0
it is the complement of 1
if input is A, the output is Y
it is the complement of A
there is only one input for NOT gate
how many combinations?
2 raised to n combinations
that means 2 raised to 1
which is equal to 2 combinations
let's draw the truth table
let's see the truth table of NOT gate
what is the truth table?
it is a table having output from all the possible combinations of inputs
this is the truth table by definition
we are studying NOT gate
the symbol of NOT gate is
NOT gate
what is the input?
it is the complement of the input
there is only one input, so there are 2 combinations
let's see the truth table of NOT gate
there is only one input
I am representing only A
the output is Y
if input is 0, what is the output?
it is the complement of 1
if input is 1, the complement is 0
this is the truth table of NOT gate
and its symbolic representation
its Boolean expression is
Boolean expression of a NOT gate
Y is equal to A bar
these are the things about NOT gate
let's see the second gate
the second gate is OR gate
the symbol of OR gate is A and B
the Boolean expression of OR gate is
Boolean expression of OR gate is
Y is equal to A OR B
there are 2 inputs A and B
how many combinations are there?
2 to the power 2
we can write 4 cases
let's see the truth table of OR gate
there are 2 inputs
A and B
the output is Y
this is the truth table of OR gate
0 OR 0 is 0
only one case is 0
the rest are 1
in an OR gate
if any one or more inputs are high
if any one or two inputs are high
the output will be high
if any one or two inputs are high
the output of an OR gate is
high
if any one or two inputs are low
the output is high
if any one or two inputs are high
the output is low
this is the symbol of OR gate
the Boolean expression of OR gate is
is a plus b or we can say it as a or b ok. Third one is AND gate ok. AND gate the symbol
of AND gate is like this. Here two inputs the output is y. a and b are the inputs here.
So this is the symbol of AND gate. Now let us see the Boolean expression of this. How
can we write Boolean expression? y equal to a and b or we can represent it as a dot b.
We can write it as a and b ok. Now look here there are two inputs. So there will be four
cases. Input a, input b, output y.
0.00, 0.10, 1.00, 1.11.
Boolean expression is y equal to a dot b or we can represent it as a and b.
That's it. Basic gates are OR gate, NOT gate and AND gate.
These three basic gates are over. Now let us see the universal gate.
Next classification is universal gates. Why is it called universal gates?
We can realize all other gates using universal gate.
The first one is NAND gate.
We can understand the name NAND gate.
NAND gate is a combination of AND and NOT gate.
NAND gate is a combination of NOT and AND.
Let us see the Boolean expression of NAND gate.
Boolean expression of NAND gate is y equal to a dot b.
Boolean expression of AND is a dot b.
Boolean expression of NOT is a dot b.
Boolean expression of NAND gate is y equal to a dot b.
Boolean expression of AND is y equal to a dot b.
Boolean expression of NOT is a dot b.
Boolean expression of AND is y equal to a dot b.
The symbol of the 4 cases is a dot b.
Symbol of a NAND gate is AND.
then what we do to that AND?
we note it and take it out
this is Y, this is A, this is B
A, B is the AND gate
we note it and take Y out
ok
for this we can say
A NAND B
how are the cases here?
a NAND gate is
effectively an AND gate
followed by an
inverter, right?
it has two or more inputs and only one
output, two or more inputs
can come for a NAND gate, but only one
output can come for it
all inputs must be high to get a low
output, ok, all inputs must
be high, in a NAND gate
case
if both the inputs are high
then only
we get a low output
if both the inputs are high
there is only one case, in that case
only the output is low
in any other case
if both the inputs are high
we get a high output
so, how can we say this?
what is a NAND gate?
it is a negative
negative
what is the gate?
OR gate
why is it a negative OR gate?
because
we had written the OR gate's truth table
there
it said, if both the inputs
are 0 or if both the inputs
are high, there is only one
output, in any other case
if both the inputs are high
we get a high output, but here
if both the inputs are high
there is only one
output, in any other case
if both the inputs are high
we get a low output
so, what is a NAND gate?
it is a negative OR gate
ok, this is
the truth table
truth table is like this
this is the truth table
in any other case
if both the inputs are high
we get a high output
in any other case
0.0 is
0
the complement of 0 is 1
in any other case
I gave 0 to A and 0 to B
0.0 is 0
the complement of 0 is 0
so we get 1
0.1 is 0
1.1 is 0
then, take the complement of 1
we get 1 again
1.0 is the same effect
0, take the complement of 1
1.1 is 1
take the complement of 1
we get 0
ok, this is the truth table
based on this Boolean expression
we have written the truth table
ok
now, let us see the next gate
NOR gate
this is also
below the universal gate
NOR gate
let us see the symbol of NOR gate
what is the symbol
of OR gate
NOR gate
there are two inputs
input A
input B
and output Y
symbol of NOR gate
is given
now, let us see the Boolean expression
Boolean expression of
which gate is NOR gate
what is it
Y equal to
OR gate
OR is A plus B
or A OR B
how to read the Boolean expression
A
NOR
B
ok
now, let us see the truth table
A
B
Y
A plus B
0
1
0
1
0
1
0
1
0