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) 7. BMT203 - DIGITAL ELECTRONICS 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
Hello students, today we are discussing about 4-bit binary parallel adder in module 2.
I hope you have understood the previous class about the adders in combinational logic circuits.
Today we are discussing about 4-bit binary parallel adder.
Consider A and B.
Normally we add A plus B.
When we add A and B, we get a sum and a carry.
I represented the sum as S.
When we add a carry, we get a sum as C.
This is how we normally add.
Now I am taking a 4-bit binary.
I am taking a 4-bit data and naming it as A0, A1, A2, A3.
The second 4-bit data is B0, B1, B2, B3.
Now I have to add this.
When I add A0 and B0, I represent the sum as S0.
When I add A0 and B0, I represent the sum as C0.
When I add C0, A1 and B1, I represent the sum as S1.
When I add C0, A1 and B1, I represent the sum as C1.
When I add C1, A2 and B2, I represent the sum as S2.
When I add C2, A3 and B3, I represent the sum as S3.
When I add C3, A3 and B3, I represent the sum as C3.
When I consider the first column, I get A0 and B0.
So, I get 2-bit data.
When I go to the second column, I get 3-bit data.
So, I get C0, A1 and B1.
When I go to the third column, I get 3-bit data.
So, I get C1, A2 and B2.
When I go to the fourth column, I get C2, A3 and B3.
So, I get 3-bit data.
So, S1, S2 and S3 are all 3-bit binary additions.
But, S0 is a 2-bit addition.
So, S0 is a full adder and S3 is a half adder.
Now, let us draw this diagrammatically.
This is the first block.
This is the second block.
This is the third box.
And this is the fourth box.
There are four cases here. S3, S2, S1 and S0.
What are the inputs here?
In the first case, I get A0 and B0.
So, I get A0 and B0.
Now, there is only sum here.
So, I get S0.
What is the carry here?
It is C0.
So, I get C0.
Now, I move to the next full adder.
This is a full adder.
This is also a full adder.
This is a full adder.
This carry moves to the next full adder.
There are already two inputs here.
They are A1 and B1.
What is the sum generated here?
It is S1.
What is the carry here?
It is C1.
This carry moves to the next full adder.
There are already two inputs here.
It is A2 and B2.
What is the sum generated here?
It is S2.
What is the carry here?
It is C2.
What is the input here?
It is the input of this full adder.
So, the input here is carry input C2.
There are already two inputs here.
They are A3 and B3.
What is the sum generated here?
It is S3.
What is the carry here?
It is C3.
This is what we have done here.
Here, S1, S2 and S3 are 3-bit binary additions.
That is why I have given a full adder here.
In the first case, only two bits are added.
That is why I said this is a half adder.
This is how we do a 4-bit parallel addition.
Now, we can replace this half adder with a full adder.
The input there is grounded.
That is, it is zero.
The grounded 3-bit binary input is here.
So, what can we replace it with?
We can replace it with a full adder.
I have replaced it with a full adder.
If we ground its input, we will get 3 inputs.
This is how we do a 4-bit parallel addition.
Let us see this with an example.
Consider 1, 0, 0, 0 plus 0, 1, 0, 1.
Here, A0 is this.
A1 is this.
A2 is this.
A3 is this.
Similarly, B0 is this.
B1, B2, B3.
Now, I am adding this.
What are the values we get when we add this?
0 plus 1 is 1.
0 plus 0 is 0.
0 plus 1 is 1.
1 plus 0 is 1.
The answer we get is 1, 1, 0, 1.
Now, let us see how this is done in a 4-bit binary parallel addition.
In this case, we can say that the full adders are connected in a cascaded manner.
I am giving these values to the inputs A0 and B0.
What is the value of A0?
It is 0.
What is the value of B0?
B0 is 1.
I am giving B0 as 1.
What is 0 plus 1?
I get the sum as 1.
Is there a carry?
No.
The carry is 0.
This 0 is the carry.
Then, A1 is 0.
B1 is 0.
A1 is 0.
B1 is 0.
What is 0 plus 0?
It is 0.
Again, 0 plus 0 is 0.
Is there a sum?
No.
The sum is 0.
There is no carry.
The carry is 0.
The carry goes to the third full adder.
The carry is 0.
It goes here.
The value of A2 is 0.
B2 is 1.
A2 is 0.
B2 is 1.
1 plus 0 is 1.
Again, 1 plus 0 is 1.
What is the sum?
It is 1.
Is there a carry?
No.
The carry is 0.
Again, the carry goes to the fourth full adder.
It goes to the fourth.
What is the value of A3?
1.
B3 is 0.
A3 is 1.
B3 is 0.
What is 0 plus 1?
It is 1.
1 plus 0 is 1.
What is the sum of S3?
It is 1.
The carry is 0.
The answer is S3, S2, S1, S0 which is equal to S3 is 1, S2 is 1, S1 is 0, S0 is 1.
the answer is S3, S2, S1, S0 which is equal to S3 is 1, S2 is 1, S1 is 0, S1 is 1.