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
it will add two binary number
one is half order
second one is full order
let's see what is half order
first one is half order
it is a circuit that adds only two bits
no carry from a previous state is considered
in the case of half order, we are not considering the previous state carry
addition of two bits in the least significant bit position
in the case of half order, only two bits are added
no carry from a previous state is considered
in the case of half order, we are not considering the previous state carry
addition of two bits in the least significant bit position
let's see the truth table of half order
two inputs are there
a and b
sum and carry
two inputs are 0
a input is 0
b input is 1
a input is 1
b input is 0
two inputs are 1
there are four possibilities
two inputs are 2 raised to 2
that means four cases
let's see the sum
0 plus 0 is sum
is there a carry?
no
0 plus 1 is sum
is there a carry?
no
0 plus 0 is sum
is there a carry?
no
1 plus 1 is sum
is there a carry?
no
1 plus 1 is sum
is there a carry?
no
0 plus 0 is sum
let's see the block diagram of half order
two inputs are there
a and b
this is half adder, it is represented by half adder, s4 sum and c4 carry, ok c4 carry, ok
now let us see the k map, k map of half adder, let us see the k map of half adder, here two
input, so four cells, here two inputs, so we can develop four cells, a input a, this is
input b, combinations are 0 1, here 0 1, now this cell is 0 0, this is 0 1, this is 1 0,
this is 1 1, now let us see what is the sum case of k map, k map of half adder, let us see
inputs a and b are 0 0, what is sum, 0, then input a is 0, b is 1, in case of 0 1, what
is the sum, 1, next a 1 b 0, in case of a 1 b 0, what is the sum, 1, in case of 2 1, what is the sum,
0, what is this, first min term, first min term and what is this, second min term, in case of sum
case of k map, first min term, second min term, here m 1 is equal to, how to write, m 1 equal to,
see this is m 1, first min term is represented by m 1, second min term is m 2, m 1 is equal to,
how to write, a bar b, not a 0, a bar b, this is written in a SOP expression, a bar b, next
m 2, how to write, 1 0, a b bar, see s equal to, how to write SOP form, a bar b plus a b bar,
that is y equal to what, a bar b plus a b bar, which is equal to a exclusively or b,
a bar b plus a b bar, sum is equal to a exclusively or b,
a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to
a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
a bar b plus a b bar, sum is equal to a exclusively or b,
a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to
a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus
a b bar, sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar b plus a b bar, sum is equal to a exclusively or b, a bar b plus a b bar,
sum is equal to a exclusively or b, a bar b plus a b bar, sum is equal to a exclusively
or b, a bar a bar b bar c plus a bar b c bar plus a b c plus a b bar c bar.
Now, let us look at the circuit diagram of the full adder.
Carry the sum.
C bar.
Or.
Sum.
Carry.
And.
Or.
A c, a b and b c.
Carry out.
This is the circuit diagram of a full adder.
Today, we have learnt about the full adder and half adder of adders.
I hope you have understood these two cases.
See you in the next class with a new topic.
Thank you.