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
