12-1. Improving the Multiplication Hardware

In this video we modify the multiplication hardware we just built to make it more efficient.

[therealpancake]

This is SO insanely useful. Thank you so much for uploading this clear and concise explanation. The way the professors handled this topic in my own lectures was kind of confusing and left me with some unanswered questions but you went ahead and tied everything together

[mahdiulchowdhury]

You are really good at this subject, Please upload more computer organization tutorials. This would really help many students

[ythien]

Dr. Edginton, your video is very helpful. Thanks

[scottmcfarland]

Nice videos, thanks. Could you cover the other methods to improve multiplication further, and possibly Systolic arrays?

[lianattily]

You explain so well! Straightforward and clear. Thank you so much

[sawsan]

thanks alot sir, this is very helpful, please make more videos about this .

[florenceni]

Very clear step by step explanation, deserve a lot more likes

[pushpatheflower]

Thank you .. helped me in computer organization.

[neginaryapour]

Thank you for your wonderful explanation .would you please explain the Boost algorithm?

[aaronemerick]

thank you. finally the description for which I was searching.

[kayakMike]

This seems like the long way.
Do karasuba!

[Nicknamelikeyours]

l would like to see more advanced topics of hardware for computation

[yuqian]

Thank you so much. This tutorial helps me a lot

[גלחביב-קח]

Hey, I really like you explanation but this method will cost me n cycles to execute the operation while the normal method(a*b) will take only one cycle thanks to optimization.

[cooler]

But what happens if you do 1111 x 1111, what happens to the lost bits?

[mspeir]

If the LSB of the multiplier is zero, why even run the adder? Just shift the product right by one.