100Billion times better than my college professor, straight forward to point and explanation was so easy to understand and to acquire as my knowledge !
I liked your presentation, it was clear and it made me understand so much more what we discussed in lectures. One thing I didn't quite understand is that how you could just "drop" and ignore the 1's after the 8th bit in the first example? Thank you for this video!
Hey dude, thanks for the great video, no doubt clearer than my professor. One thing I want to ask is that, at 10:58, when you were doing sign extension for the last row, why is it extended with 0, instead of 1? Is it because the multiplier is negative? If so, does that mean if the multiplier is not negative, we extend it with 1? ( assuming that row is not multiplying by 0)
What if you go from 4 bits to 8 bits so you have 11110110 and 11111001 how du you do that because in 4 bits the last number was negated but which number gets negated there.
Hey Julia ,thanks for asking the question . Why sign extension ? Because if don't extended according to sign then we will not get the same value , -ve will turn into +ve and vice versa . How did you add sign extension? Just simple binary addition 1+1 = sum is 0 carry is 1. 1+1 = 2 decimal , binary 010 1+1+1 = 3 decimal , binary 011 So on... Hope this clears your doubt , if not feel free to comment , I will appreciate it👍 Please do subscribe , it will help me a lot 🙏
I have two 8 bit signed 2s compliment numbers (3bit integer and 5bit fraction). Have to multiply them and store result in 8bit only. Also have to round off
@@KarthikVippala but on a serious note, agar apka nam kartik nhi hota, i could also think that, you are a foreigner! 😅🙌 (accent sudharne wali bat mazak m bola tha han, dont take it seriously, you are good with that! )🙌
There is a simpler method: 1. Treat the computational process as regular unsigned multiplication (if one of the numbers or both of them are negative, convert them back to unsigned numbers first, using 2's complement ) 2. Perform multiplication 3. If the product is what we are looking for, then it is done. If the product should be negative, but it is positive, the method is simple, perform 2's complement to convert your product to a signed number. done. You are prone to make less mistakes using this method. Cheers.
100Billion times better than my college professor, straight forward to point and explanation was so easy to understand and to acquire as my knowledge !
Thank you , grateful 🙏🙏
after watching the other bs videos, i have finally come across one that makes it simple and ez to do! Thanks so mucH!
Greatful for the support 🙏, good luck & great health 👍😊
thank you so much ! I don't understand why professors can't simply and effficiently explain like you do
Namaste 🙏 Eya laribi , grateful it helped you , thanks for the support, good luck and great health 👍😊
Your English is so good as I watch Indian channels and cant understand things. Content good as well. Also teaching is great :)
Thank you S K for such supportive words 🙏 , good luck, good health 👍😊
explained with a very simple way
rather than other methods its quite easy and understandable, well explained!
Arey jigar aap idhar kidhar.
Thank you👍
@@Abbas-xd1mc Bro your suggestion was quite good! : )
I liked your presentation, it was clear and it made me understand so much more what we discussed in lectures. One thing I didn't quite understand is that how you could just "drop" and ignore the 1's after the 8th bit in the first example?
Thank you for this video!
Because those one's are equivalent to signed bit extension
Clearest tutorial ever! Thank you!
Namaskaram 🙏 , your welcome, good luck, good health 👍
This has been very helpful and insightful. Thank you sir!
Your welcome, goo luck , good health 👍
thank you so much sir ... finally i have understood the concept.... much better explantion than others
Means a lot sir.... Finally i have understood the concept......
Hey dude, thanks for the great video, no doubt clearer than my professor. One thing I want to ask is that, at 10:58, when you were doing sign extension for the last row, why is it extended with 0, instead of 1? Is it because the multiplier is negative? If so, does that mean if the multiplier is not negative, we extend it with 1? ( assuming that row is not multiplying by 0)
did you ever find this out?
Thank you so much sir for saving me in my difficult time sir🥺🥺🥺🥺
Namaste 🙏 Amruta, glad it helped you, good luck & great health 👍😊
Sir upto the point sir u explained no single teacher explained exactly to the point sir once again thanks sir
What is the difference between normal binary multiplication and multiplication in 2's complement
Very clean and understandable explanation !
Namaskaram Matthias Jochen🙏 , thanks for the support, good luck & great health 👍😊
thank you
-13,-9 can we apply 2nd process?
Yes raj
Thank you so much 💖 I was struggling with this
Your welcome 🙏
Thank you so much sir! your explanation is so easy to understand
Namaskaram _/\_ Eleanor Janine Juan, You are most welcome, Good Luck & Great Health :)
Well understood
Thank you
thankyou🔥🔥🔥
Thank you sir
this was very helpful, thank you
Your welcome 🙏
Very neatly explained bro i appreatiate it thanks for explainimg
Namaskaram 🙏 kashish , thanks for the support, good luck, good health 👍😊
@@KarthikVippala pls do make more videos on computer org & architecture (mca) it would be really helpful for us ..
Sure 👍
best video
Thank you so much 🙏
Tqsm it is easily understandable
Namaskaram 🙏, Nishad , thanks for the supportive words , good luck, good health 👍
Thank you❤
Very helpful content :D
Thank you so much john , good luck 👍
Very good
Thankyou brother
Your welcome🙏
Thanks man appreciate it
Thank you so much
Namaste 🙏 Ankit , your welcome , good luck & great health 👍😊
Such great Efforts ♥️♥️
Thank you🙏
Sorry I tried again your home work problem and it works thanks you so much
thank you so much ❤❤❤❤❤❤❤
Namaste 🙏 Mr.A , thanks for the support, good luck & great health 👍😊
Thanks a lot 😊
Your welcome, good luck, good health 👍😊
Thanks bro!
Your welcome, good luck, good health 👍
What if you go from 4 bits to 8 bits so you have 11110110 and 11111001 how du you do that because in 4 bits the last number was negated but which number gets negated there.
You are the man
😂 I know that.!!
Thanks for the supportive words 😊
Good luck, good health 👍
why we are going for sign bit extension
nicely explained........
Namaskaram 🙏 Dilip , thanks for the support, good luck & great health 👍😊
Awesome video.
Thank you , good luck, good health 👍😊
Great job!
Thank you🙏
beautiful
Thank you🙏
thanks a lot !!!!!!!! helps a lot
Thank you, for the kind & supportive words ,love from India
Good luck, good health 👍
podu thala🥵mass
🙏
Generally -8421 ....right sir
For signed 2's complement
Thank u so much man 🥰
Namaskaram 🙏, thanks for the support, good luck & great health 👍😊
why and how did you add the sign extension
Hey Julia ,thanks for asking the question .
Why sign extension ?
Because if don't extended according to sign then we will not get the same value , -ve will turn into +ve and vice versa .
How did you add sign extension?
Just simple binary addition
1+1 = sum is 0 carry is 1.
1+1 = 2 decimal , binary 010
1+1+1 = 3 decimal , binary 011
So on...
Hope this clears your doubt , if not feel free to comment , I will appreciate it👍
Please do subscribe , it will help me a lot 🙏
@@KarthikVippala thank you so much, you have helped me tremendously
@@juliazhang3600 thanks for your feedback , and feel free to ask doubts if you have more👍 on other topics also
god I wish you were my professor
Grateful for the support 🙏
Very helpful
Thank you 😊, good luck good health 👍
@@KarthikVippala you're welcome, you also stay safe and healthy 😊😊
Thank you 😊
what will you do if the output can only be stored in 4 bits and not 8 bits?
Hey Utkarsh thanks for asking the question,
in this case data will be lost and we need exact bits for result
You mean we can't get exact result with 4bits
But I have been asked to do so using fixed point numbers and also round off the result.
I am confused how to proceed.
Any help is appreciated 😊
Can you provide the question 👍
I have two 8 bit signed 2s compliment numbers (3bit integer and 5bit fraction).
Have to multiply them and store result in 8bit only.
Also have to round off
can u help me to write its varilog code???
but why are you extending ?
Sign extension will not change the number
@@KarthikVippala ok got it!
Thank you
Your welcome🙏
If the question is in 8 bits? We double the sign extension to 16?
Yes Abbas you are correct, we need to extend till 16 bit for answer rest you can ignore.
Thanks for asking the question 👍
@@KarthikVippalaThanks.
Your welcome 👍😊
@@KarthikVippala Btw do you have any idea of a method in which we take 2s complement of multiplier and add with the multiplicand ?
If we take 2's complement and add it then it will become subtraction.
good
Namaste 🙏 hashan , your welcome, good luck & great health 👍😊
from which college did u graduate..?
🤫Top secret 😉
can we extend the value using 0 instead of 1 at 4:30
No
What to do when 11×-13???
Like when no greater than 7
I represented in 6 bit form
Is it correct
But then till where to extend
And are there any changes in the steps
you are telling that how to do. please tell me why to do also
can u pls add link to the next video also
Can you be clear about , which link?
@@KarthikVippala in the video u mentioned u will say the last explanation in the next video , for 5 x (-7)
I am gonna explain a new method booths algorithm for multiplication (on same topic ) tomorrow .
Please check it out .
Thanks for asking, good 👍
@@KarthikVippala ✌️
Yooo youu areee greaatuuaa !!!😂😂
You to are greaatuuaa 👍😊
great!bro
Thanks 🔥
U forgot to put 32
god bless
Namaskaram John 🙏 , good luck & great health 👍🤗
hey what if division
Try , if any doubts pls comment good luck & great health 👍😊
goat
🙏thank uuuuu
video was good, but accent sudhaar lo apna!😂
Ok bhai 😁
@@KarthikVippala but on a serious note, agar apka nam kartik nhi hota, i could also think that, you are a foreigner! 😅🙌 (accent sudharne wali bat mazak m bola tha han, dont take it seriously, you are good with that! )🙌
Thank you 😊, good luck & great health 👍😀
I guess you can also teach without that fake Accent
Yeah , now I learnt ,😀 , thanks for feedback, good luck & great health 👍😊
helo
🙏 namaskaram
Please use your original Indian accent. This one sounds wierd.
Even Miracles , I get confidence in this way , so I can't do it in any other way.
Good luck, good health 👍
@@KarthikVippala its okay to be like that....just in case if you are wondering that you might be wrong
@@sahithi1546 thanks for the support, good luck, good health 👍
ll
Namaskaram _/\_ Hashan.
There is a simpler method:
1. Treat the computational process as regular unsigned multiplication (if one of the numbers or both of them are negative, convert them back to unsigned numbers first, using 2's complement )
2. Perform multiplication
3. If the product is what we are looking for, then it is done. If the product should be negative, but it is positive, the method is simple, perform 2's complement to convert your product to a signed number. done.
You are prone to make less mistakes using this method.
Cheers.
thank you❤
Your welcome