Neso when I get a job as a software dev I'm coming back and donating money to this channel mark my words. You consistently have the best explanations for CS curriculum and these videos have saved me countless times.

@saiayushmohapatra9498

3 ай бұрын

Chal jhoota 😂

This is a really well thought-out explanation of the algorithm. My course glanced over it and I never really understood why Booth's algorithm works, so I am grateful to have found a really good explanation between this video and the precursor! Thanks!

I was watching another video of this channel at night and at 12:50am 🌃 that video was over but suddenly this video started and I got afraid 😳 with the starting introduction voice and then i feel that this voice is coming from my mobile. Thank god 🙏

@Oxytocin_NA

7 ай бұрын

bro's onto nothing 🗣️🗣️🗣️🗣️❌❌❌💨💨

@55562009

7 ай бұрын

let him cook

@anmolsrivastava1206

7 ай бұрын

adding the fact that intro is creepy without context

@aaryansingh2004

5 ай бұрын

bro cooked

@D-Gowda09

4 ай бұрын

But better than 'Hellooo Bachhoooo🗣️🗣️' 😂😂

Incredible

Cool! You made my mind

I guess it's better to not do ARS for the last step. Even in Booths paper, it's written not to multiply by 2^-1 for m0 (no ARS in the last step)

Why implement and the previous video isn't same??

I just wanna say, i am an Electrical engineering major specializing in Power systems and control, and i hate computer bs so much, thanks

@omanshsharma6796

9 ай бұрын

and I just wanna say, as a computer science engineer specialising in blockchain technology, I hate all the electrical bs so much, thanks

what about division??

Why we add sometimes 1,and some time 0

@tejanverma6623

10 ай бұрын

Because it's 2's complement, we add 1 when msb of A is 1. and 0 if it's 0. Only when we shift.

Nice video and you're correct about Booth's algorithm being able to handle signed multiplications. But you are mistaken about its speed. On average both Booth's algorithm and the conventional method have exactly the same number of multiplications and hence Booth's algorithm is not faster. In fact, on average, Booth's algorithm will be slower on more multipliers than the conventional method if you examine all 2^N possible multipliers for a N bit multiplier. For instance, look at the 32 possibilities for a 5 bit multiplier, after each possibility I'll indicate the number of additions for Booth and the number for the conventional approach: 00000 = 0 0 00001 = 2 1 00010 = 2 1 00011 = 2 2 00100 = 2 1 00101 = 4 2 00110 = 2 2 00111 = 2 3 01000 = 2 1 01001 = 4 2 01010 = 4 2 01011 = 4 3 01100 = 2 2 01101 = 4 3 01110 = 2 3 01111 = 2 4 10000 = 1 1 10001 = 3 2 10010 = 3 2 10011 = 3 3 10100 = 3 2 10101 = 5 3 10110 = 3 3 10111 = 3 4 11000 = 1 2 11001 = 3 3 11010 = 3 3 11011 = 3 4 11100 = 1 3 11101 = 3 4 11110 = 1 4 11111 = 1 5 Notice that both approaches have a total of 80 additions over the entire set of 32 multipliers. Additionally, where the counts differ, Booth "wins" 10 times, while the conventional approach wins 13 times. The reason that the conventional method wins more often than Booth, while they both have the same total number of additions is because when the conventional method "wins", it wins by a small margin, while when Booth wins, it wins by a large margin. If you examine longer multipliers, you'll see that the pattern continues. They both take the exact same number of total additions when all possible multipliers are considered and when one of the algorithms uses fewer additions, the conventional algorithm is faster more often than Booth. Now, there is another advantage of Booth when multiplying in hardware. Namely, Booth requires fewer "hard multiples" when using a higher radix. For instance, Radix-4 Booth examines 3 bits at a time and shifts by 2 bits each iteration. The table looks as follows: 0 0 0: 0 0 0 1: 1N 0 1 0: 1N 0 1 1: 2N 1 0 0: -2N 1 0 1: -1N 1 1 0: -1N 1 1 1: 0 Notice that 1N, 2N, -1N, and -2N need to be computed and potentially used for each iteration. All of those multiples are easy since they're nothing more than a routing of a wire and a logical not of a routed wire. On the other hand, a conventional Radix-4 would need to get the following multiples: 1N, 2N, 3N. The 3N is a "hard multiple" in that it requires a full blow addition operation along with the associated propagation of a carry, making the hardware more complicated and potentially slower.

Please Complete this course early

When this course is going to complete....2050😂😂😂 . . . Or when you are going to upload ppt...in 2090😂😂😂

@tanvirsayyad3478

Жыл бұрын

🤣🤣

@ankitmajee

Жыл бұрын

How to get the ppt

@anuragsoni5561

7 ай бұрын

This course will complete when GTA V releases

@user-sc1wi7nz2n

7 ай бұрын

@@anuragsoni5561VI*

@aaryansingh2004

5 ай бұрын

@@anuragsoni5561 *VII

Booth algorithm fails for 14 x 6

No need to this disgusting intro and then just speed up the ppt..make sure the slow pace maintain in the whole ppt

@user-sc1wi7nz2n

7 ай бұрын

😂😂What's disgusting about that intro brother?

The explanation is good however kindly use your normal voice otherwise it is offensive to viewers...thank you

@kumarangl2013

6 ай бұрын

What did u find wrong in his voice or accent. Just grab the concept brother. He is too good in making the process clear. I appreciate him and thank him for his work. It's not his voice to be changed, it's your mind set of hearing sounds must be changed. Don't hear just listen 👂👂👂

@sec5112

6 ай бұрын

​@@kumarangl2013shut up

@D-Gowda09

4 ай бұрын

​@@kumarangl2013🙌🏻🙌🏻

@OneHandedProGaming

4 ай бұрын

LGTV 😂😂 🌈

@D-Gowda09

4 ай бұрын

@@OneHandedProGaming No bro.... respect Karo yar..

The explanation style is too much irritating. Why are you explaining like this? you must use your normal voice do not make it irritating. PLEASE FOLLOW YOUR COLLEAGUES VIDEO. Note: Nobody from the USA is going to listen to this video.

@Skeptics.h

7 ай бұрын

Exactly this is extremely annoying

@user-sc1wi7nz2n

7 ай бұрын

What's annoying brothers?

@guy.with.moustache

2 ай бұрын

Wtf bro

@guy.with.moustache

2 ай бұрын

Who hurt u

Thank you soooooo much! You’re the only person out of like 12 videos that explained this clearly enough for me. 🫶🏾