Timestamps: 0:00 Half Adder Circuit 3:41 Full Adder Circuit 11:52 Full Adder using Half Adders For Notes, check this link: www.allaboutelectronics.org/half-adder-and-full-adder-explained/ For more information, check this playlist of Digital Electronics: ua-cam.com/play/PLwjK_iyK4LLBC_so3odA64E2MLgIRKafl.html
I ' m korean and i m here to see your video beacuse i m learning this in high school..my school teaches this content in subject, computer..i just want to say thank you for uploading this video you save my life...i spend so much time on this, now finally you made me be understood
Thank you so much for this perfectly outstanding explanation! I finally understand half and full adders after watching so many YT videos and going through countless PPT slides and textbook pages. All of them either didn't explain anything and encouraged us to just memorize the truth tables, or attempted to explain this topic but ended up being convoluted. This is what real teaching is! May God bless you, and thanks again.
I have a question... Jab apny k map use kya to us me jo values put ki wo pos me hain lekin apny usy sop me likha hoa tha or 1 se represent kya... Yhan se smjh nhi ai please thorra explain kardain
Thanks for the video! But i have a question in minute 6:30 : Can we instead of doing the normal form directly jump to in which scenarios, for example, Sum is 1? we have C.in + B + A + ABC.in. Same for the C.out I saw you doing something like that in the enconder video. Why do we do diffferent here? Last question. If doing like I said, can we manipulate the result to xor or xnor gates as in the video?
00:10 Half Adder adds two bits to give sum and carry output 01:58 Understanding Half Adder Logic Circuits 03:40 Full adder is a combinational circuit that adds two bits and the carry bit to generate sum and carry as output. 05:26 Explanation of the full adder truth table and Boolean expressions. 07:18 Simplified expressions of sum and carry outputs using XOR and K-map 09:05 Explains alternative ways of expressing carry output 10:57 Explaining the logic circuit of the full adder using XOR and AND gates. 12:48 Explains the design of a full adder using two half adders and an OR gate
See this is the special case, where we are getting this condition. That means, using either OR gate or the XOR gate, we can get the same result. If you see the carry output, then it is equal to 1 when both A and B are 1, or when Cin is 1 and either A or B is 1, or all three inputs are 1. So definitely, using OR gate, this condition will get satisfied. If we use the XOR gate, then whenever A = B = Cin = 1 then Cin (A ⊕ B) will be 0. But since both A and B are 1, so first term (A.B) will be 1. And in this way, using both XOR gate, or the OR gate, we are able to produce same result. I hope, I was able to convey the reason for that. In case, if you still have any doubt then let me know here.
Sir Sir I am a beginner now. And may want to become electronic engineer. Where do I start and what is my path? What is my path for electronic engineer. I were saw your playlist but I am very confused where to start. Technology playlist?
sir is something wrong here 8:59 bcoz the simplified answer and the value you took for Cout don't match i don't have an idea about what happened could you please explain
Both expressions of Cout are correct. At 9:00 onwards, I have explained that how we can get the second simplified expression from the first expression. The expression has been written from the truth tables. ( It is the summation of all the mimterms for which the output is 1) I hope, it will clear your doubt.
why do so many indians speak english with the weird pause and pitch raise in random spots? Like: this is the sum and the?.... *carry* A is equal to B and ?.... *C bar* why do they pause in random?... *places* maybe it is for?... *suspense* but if it?... *is then* it's not?... *working*
maybe because english isnt their first language? lol, it happens because non native speakers tend to apply the speech rules and sounds of their native language while speaking other languages like english
It is already added in the digital electronics playlist. Please revisit the playlist. You will get it. Here is the link : ua-cam.com/play/PLwjK_iyK4LLBC_so3odA64E2MLgIRKafl.html
It is created from the truth table. It is the summation of all the minterms ( input combinations) for which the output is 1. 6:30 onwards I have explained that.
It can be implemented using 3 input XOR gate. but as I have shown in the video, the sum expression can also be represented as AB + Cin. A ( XOR) B. So, using the some part of the carry generating circuit, the sum generating circuit can be designed. And in this way, number of logic gates used in the circuit can be reduced. Just to show that, it was represented using two XOR gates.
It is the digital circuit which is made up by combining different logic gates. In the combinational circuit, the output of the circuit depends only on the present inputs of the circuit. (There is no feedback from output to input side)
For further simplification, B ( XOR) Cin is assumed as another variable X. That means now, B ( XOR) CIN = X and [ B ( XOR) CIN ] ‘ = X’. And the overall function will become A’.X + A.X’. And that is equal to A( XOR) X. Or it can be represented as A( XOR) B ( XOR) CIN.
00:10 Half Adder adds two bits to give sum and carry output 01:58 Understanding Half Adder Logic Circuits 03:40 Full adder is a combinational circuit that adds two bits and the carry bit to generate sum and carry as output. 05:26 Explanation of the full adder truth table and Boolean expressions. 07:18 Simplified expressions of sum and carry outputs using XOR and K-map 09:05 Explains alternative ways of expressing carry output 10:57 Explaining the logic circuit of the full adder using XOR and AND gates. 12:48 Explains the design of a full adder using two half adders and an OR gate
Timestamps:
0:00 Half Adder Circuit
3:41 Full Adder Circuit
11:52 Full Adder using Half Adders
For Notes, check this link:
www.allaboutelectronics.org/half-adder-and-full-adder-explained/
For more information, check this playlist of Digital Electronics:
ua-cam.com/play/PLwjK_iyK4LLBC_so3odA64E2MLgIRKafl.html
hi. tnx for learning. how do u create this videos? the table, elements and formulas?
yes please tell me which software you are using for making these videos ... please
I ' m korean and i m here to see your video beacuse i m learning this in high school..my school teaches this content in subject, computer..i just want to say thank you for uploading this video you save my life...i spend so much time on this, now finally you made me be understood
This place is a goldmine
In search of gold I got a diamond
And I'm the pro-est gold miner
For reallll😭
Yes bro
Fr man
Would just take a moment to give much thanks for this interesting explanation, i'm sure it's gonna help so many people out there. 💌
This is a better explanation than my professor’s explanation
Thank you so much for this perfectly outstanding explanation! I finally understand half and full adders after watching so many YT videos and going through countless PPT slides and textbook pages. All of them either didn't explain anything and encouraged us to just memorize the truth tables, or attempted to explain this topic but ended up being convoluted. This is what real teaching is! May God bless you, and thanks again.
That's why lectures r gods , especially who explains in UA-cam 🙏🏻
Here is not only about being a Genuis, this is real teaching 🙏🏿❤️
Nice qote black enzyme
Such a great explanation sir ! You have my respect sir, your explanation is way more better than our college faculties.
My exam is in 2 hour's band I'm watching this channel is too satisfying 😌
Which
Thanks for such a great video. It was so clear and I was even to draw the Full Adder and simplify some of it myself!
The world's best teacher thanks
hats off sir amazing explanation my professor need to see these vedios :)
this video was so well done, such a good explanation thank you!!!
Excellent mind blowing explanation bro. May god bless you . thank you so much for your video s. 🎉🎉
Your content is so helpful, thanks so much!
Finally Got the useful video☺️❤️
Thank you sir
Thanks you so much sir, explanation is outstanding ,for making the videos once again thank you sir
Thank you sir
Awesome explanation
Excellent explanation
Thank you sir for this amazing video
I am getting brain damage from the way you speak, but thank you for the information
Legendary explanation
excellent teaching👌
nice video bro keep teaching us
Thank you sir for that half and full adder
I have a question...
Jab apny k map use kya to us me jo values put ki wo pos me hain lekin apny usy sop me likha hoa tha or 1 se represent kya...
Yhan se smjh nhi ai please thorra explain kardain
Thanks for this video. It helped a lot.
Sir.....
When a BJT functions as an amplifier, which of the following is controlled?
Collector current, emitter current, base current or all ?
base
Base current because it depends on BetaDC.
Thank you very much 👍
Thanks for the video! But i have a question in minute 6:30 : Can we instead of doing the normal form directly jump to in which scenarios, for example, Sum is 1? we have C.in + B + A + ABC.in. Same for the C.out
I saw you doing something like that in the enconder video. Why do we do diffferent here?
Last question. If doing like I said, can we manipulate the result to xor or xnor gates as in the video?
00:10 Half Adder adds two bits to give sum and carry output
01:58 Understanding Half Adder Logic Circuits
03:40 Full adder is a combinational circuit that adds two bits and the carry bit to generate sum and carry as output.
05:26 Explanation of the full adder truth table and Boolean expressions.
07:18 Simplified expressions of sum and carry outputs using XOR and K-map
09:05 Explains alternative ways of expressing carry output
10:57 Explaining the logic circuit of the full adder using XOR and AND gates.
12:48 Explains the design of a full adder using two half adders and an OR gate
Thank you for the video.. Very useful
Excellent explanation sir ❤
Thank you so much sir
I can't thank you enough.❤️
Wow..
Awesome explanation...🔥🔥
The constant voiceovers are so funny
just awesome 😀
What program did you use to draw like you did in this video?
very good and informational video, truly explained it very well
Great video. Really Helpful 🙂
Mind-blowing explain..!
Thank u so much sir 🙏
class 11th students wo took computers for granted
Excellent class 👌🏼👌🏼
thanks a lot. u r a life saver.
That's what I am searching .
Thank you ! thank you !!
Great explanation.
Tomorrow is my exam and I am fully prepared 🙏
I guess.... I dropped in a goldmine
And I in problems
And I in problems
Thank you 👍
love you sir g
Sir when we wrote carry in two different fashion by equating them why are we getting that or gate equals exor
See this is the special case, where we are getting this condition. That means, using either OR gate or the XOR gate, we can get the same result. If you see the carry output, then it is equal to 1 when both A and B are 1, or when Cin is 1 and either A or B is 1, or all three inputs are 1. So definitely, using OR gate, this condition will get satisfied. If we use the XOR gate, then whenever A = B = Cin = 1 then Cin (A ⊕ B) will be 0. But since both A and B are 1, so first term (A.B) will be 1. And in this way, using both XOR gate, or the OR gate, we are able to produce same result. I hope, I was able to convey the reason for that. In case, if you still have any doubt then let me know here.
@@ALLABOUTELECTRONICS thank you so much sir. I got it. U da 🐐
Nice 👍
Super sir..thank u so much
Thank you
Legend
Super 💞
in full adder the output of A XOR B and Cin was again sent to another XOR gate. Why?
It is given to the OR gate. ( Just to generate Cout)
Please check it again at 11:23.
If you still have any doubt then let me know here
super sir
6:29 Where from boolean expression comes
From the truth table, it is the summation of all the minterms for which the S is 1.
I hope, it will clear your doubt.
Thanks a lot
You saved me 😂
Sir Sir I am a beginner now. And may want to become electronic engineer. Where do I start and what is my path? What is my path for electronic engineer. I were saw your playlist but I am very confused where to start. Technology playlist?
Start with the basic electronics playlist.
ua-cam.com/play/PLwjK_iyK4LLCAN5TddEZyliChEMpF0oOL.html
After that, you may go through the network analysis and analog electronics playlist.
sir is something wrong here 8:59 bcoz the simplified answer and the value you took for Cout don't match i don't have an idea about what happened could you please explain
Both expressions of Cout are correct. At 9:00 onwards, I have explained that how we can get the second simplified expression from the first expression. The expression has been written from the truth tables. ( It is the summation of all the mimterms for which the output is 1)
I hope, it will clear your doubt.
@@ALLABOUTELECTRONICS thank you sir
why do so many indians speak english with the weird pause and pitch raise in random spots? Like:
this is the sum and the?.... *carry*
A is equal to B and ?.... *C bar*
why do they pause in random?... *places*
maybe it is for?... *suspense*
but if it?... *is then*
it's not?... *working*
There is no specific reason.Its just a weird part of our accent.
maybe because english isnt their first language? lol, it happens because non native speakers tend to apply the speech rules and sounds of their native language while speaking other languages like english
This video is not added in the playlist in youtube.
It is already added in the digital electronics playlist.
Please revisit the playlist. You will get it.
Here is the link : ua-cam.com/play/PLwjK_iyK4LLBC_so3odA64E2MLgIRKafl.html
Neumont College of Computer Science checking in
@@antwanwimberly1729 just a random dude who’s obsessed with computer science checking in!
Nandri Solla Unakku Vaarthai Illai Enakku🥺
Excellent 👍
How does sum equation and carry equations are created
It is created from the truth table. It is the summation of all the minterms ( input combinations) for which the output is 1. 6:30 onwards I have explained that.
Nice explanation
Thanks
Thanks sir ❤❤
Fantastic 👌👌
sir why we cannot give 3 inputs in Exor gate
It can be implemented using 3 input XOR gate. but as I have shown in the video, the sum expression can also be represented as AB + Cin. A ( XOR) B.
So, using the some part of the carry generating circuit, the sum generating circuit can be designed. And in this way, number of logic gates used in the circuit can be reduced.
Just to show that, it was represented using two XOR gates.
Sir what is combinational circuit ???
It is the digital circuit which is made up by combining different logic gates. In the combinational circuit, the output of the circuit depends only on the present inputs of the circuit. (There is no feedback from output to input side)
@@ALLABOUTELECTRONICS sir can you briefly explain the term " feedback " , I'm confused
Please check the video on Sequential Circuits. You will get the idea.
Here is the link : ua-cam.com/video/fLN1YOmuAr8/v-deo.html
@@ALLABOUTELECTRONICS Thanks
Osm ✨
kush hogaya
🤝
Did not undrstand at 7:20 😢
For further simplification, B ( XOR) Cin is assumed as another variable X. That means now, B ( XOR) CIN = X and [ B ( XOR) CIN ] ‘ = X’. And the overall function will become A’.X + A.X’. And that is equal to A( XOR) X. Or it can be represented as A( XOR) B ( XOR) CIN.
😂
drndr
Text in black below is disturbing😢
You can turn off the subtitles manually in the video settings.
thank you soooo much 🥹🥹🥹
thank you
00:10 Half Adder adds two bits to give sum and carry output
01:58 Understanding Half Adder Logic Circuits
03:40 Full adder is a combinational circuit that adds two bits and the carry bit to generate sum and carry as output.
05:26 Explanation of the full adder truth table and Boolean expressions.
07:18 Simplified expressions of sum and carry outputs using XOR and K-map
09:05 Explains alternative ways of expressing carry output
10:57 Explaining the logic circuit of the full adder using XOR and AND gates.
12:48 Explains the design of a full adder using two half adders and an OR gate
Thank you so much 🙏