My Brother in Christ this one helped me understand BCD Adder in like 7 minutes max. Explained better than my professor. You're a lifesaver, thanks a lot :D
i have never commented on any educational videos , i must say sir you are amazing , i was not only able to grasp the concept but also was able to understand the working and construction of diagram.
8:15 I searched for 3 hours and I can clearly say that we have to consider the second binary adder's carry output as the output of f1. I guess there is a mistake on classification of carry outputs. Let's say the first binary adder's carry is Cf and the second adder's carry is Cs. In some cases we get Cf = 0 and Cs = 1 or vice versa. While the output BCD's carry bit is 1, Cs is 0 in some cases. If we consider f1 as the output carry, it will satisfy all conditions.
@@Nikobellic415 in the square he boxed, all the 1s have a common S3 (S3 = 1) and a common S1 (S1 = 1), and since this is a sum of products, S3 = 1 refers to non complement form and S1 = 1 also refers to non complement form, thus we get S3S1
n1 and n2 aren't set = 0, it just leads to the result = 0 with a connection like that (if the sum is valid, with any combination input S0,S1,S2,S3 none of them have the result = 1)
You are taking for ex 5 and 6 as valid input but it's output is 11 which is invalid and many more input are there which you are taking as valid but it's o/p is invalid
My Brother in Christ this one helped me understand BCD Adder in like 7 minutes max. Explained better than my professor. You're a lifesaver, thanks a lot :D
wtf is this nga on about
I have already finished amazing Combinational circuits chapter by Sujeet Sir but these illustrations are mind blowing.
Bhai ec 2nd year sub k liye channel bta do
@@TheGenuineTrader26 ?
@@TheGenuineTrader26 sahav singh yadav
i have never commented on any educational videos , i must say sir you are amazing , i was not only able to grasp the concept but also was able to understand the working and construction of diagram.
Mind blowing explanation sir❤.
Thank uhh so much for this....Really helpful and very clear explanation
YOU ARE A LIFE SAVER
Wonderful explanation
GG, taught me so easily
8:15 I searched for 3 hours and I can clearly say that we have to consider the second binary adder's carry output as the output of f1. I guess there is a mistake on classification of carry outputs. Let's say the first binary adder's carry is Cf and the second adder's carry is Cs. In some cases we get Cf = 0 and Cs = 1 or vice versa. While the output BCD's carry bit is 1, Cs is 0 in some cases. If we consider f1 as the output carry, it will satisfy all conditions.
is the circuit shown in the video not correct?
Nice explanation ❤❤❤❤❤❤❤❤❤❤❤❤
Really Insightful!!
THANK YOU SO MUCH
Amazing explanation 🎇
Thankyou 😇
Love you sir great you are ...💓😌
Amazing, thank you so much sir
Nice explanation sir
7 mark conferm ❤❤❤
wwooooww it's great, like the explanation is too good. thanks a lot
Thank you sir
Very oustanding course.
f=S3S2 OR S3S1 = S3 AND (S2 OR S1).
thank you, sir
I have been watching videos in 2x on a regular basis, now watching them on normal speed feels tripping
Thank you sir... So much information... Sir please post Digital question and answer as aspects to a Design Engineer..
Thank you sir 😃😃
Thank you so muchhhhhh
Did U juz show the cyclic nature of gray Code @3:44 ?
How do you do dat man!!
SOOOO Precise!
It repeats the same pattern at a point.
Idk how did he got s3s1 ?
@@Nikobellic415 in the square he boxed, all the 1s have a common S3 (S3 = 1) and a common S1 (S1 = 1), and since this is a sum of products, S3 = 1 refers to non complement form and S1 = 1 also refers to non complement form, thus we get S3S1
Sir can you make videos on microprocessor and microcontrollers please🙏.
Thank you ❤️
Thanks :)
what arrangements we have to do to add 10+10?
Shouldn't the final carry be the upper one?
i got one question, why do we use pattern 6 - 0110 to calculate with the invalid digital number 10 - 1010? (1010 + 0110)
Cause then it'll get reset to the corresponding number, for eg: 10 + 6 will give 15 that is 0
I need BCD subtractor in combinational circuit sir can you please do that
Sir what about 10,
I mean, we can not add 1010 +1010. When we add (1010+1010) or above 1010, it give error, why????
What can I do to be successful like you after my first degree
Sir what is BCD divider.... its my project... please explain it
>>>>>>>my clg proffs
How to correct for 72 and 76
i didnt get why n1 and n2 are set 0, if the sum is valid
n1 and n2 aren't set = 0, it just leads to the result = 0 with a connection like that (if the sum is valid, with any combination input S0,S1,S2,S3 none of them have the result = 1)
is this 1 bit BCD adder?
Glenda Common
Ward Stravenue
Merritt Curve
Stanton Springs
👌👌👌
Parker Trail
Crooks Mill
Deshawn Common
Luettgen Lodge
Ankunding Fields
Marvin Throughway
Tillman Lakes
Cronin Causeway
Christopher Mountains
Melyna Springs
Jade Prairie
Davion Rapid
🙏
Stroman Drive
Dimitri Crest
Johnson Harbor
Bashirian Ranch
Hauck Key
Explain according to the adder next time
Leanne Ramp
Robel Plaza
Waelchi Court
Fredrick Summit
Sadye Park
Annabel Mews
Koepp Manor
Herzog Loop
Courtney Square
Reynolds Valley
🥰
Bergnaum Camp
Haag Highway
Batz Well
Prohaska Branch
Trantow Lakes
Anya Key
Mf
Mayert Stream
😶
Jamel Circle
Are u in hurry. Your way of explanation is not that good the one of have uploaded 8,7 years ago.
Thanks for comment man..
You are taking for ex 5 and 6 as valid input but it's output is 11 which is invalid and many more input are there which you are taking as valid but it's o/p is invalid
55 possible pairs
Mind blowing explanation sir.❤❤❤❤
Thanks :)