12-1. Improving the Multiplication Hardware

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ •

  • @therealpancake7140
    @therealpancake7140 11 місяців тому +1

    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

  • @mahdiulchowdhury1589
    @mahdiulchowdhury1589 6 років тому +4

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

  • @scottmcfarland1
    @scottmcfarland1 3 роки тому +3

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

  • @lianattily282
    @lianattily282 4 роки тому +1

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

  • @ythien7147
    @ythien7147 6 років тому +2

    Dr. Edginton, your video is very helpful. Thanks

  • @florenceni4502
    @florenceni4502 5 років тому

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

  • @neginaryapour6274
    @neginaryapour6274 5 років тому +1

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

  • @sawsan5495
    @sawsan5495 6 років тому +2

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

  • @TheFelipe10848
    @TheFelipe10848 5 років тому +1

    Great video!

  • @pushpatheflower3617
    @pushpatheflower3617 5 років тому +2

    Thank you .. helped me in computer organization.

  • @aaronemerick2719
    @aaronemerick2719 3 роки тому

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

  • @kayakMike1000
    @kayakMike1000 Рік тому

    This seems like the long way.
    Do karasuba!

  • @Nicknamelikeyours
    @Nicknamelikeyours 7 років тому

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

  • @alexandrkovalsky1711
    @alexandrkovalsky1711 Рік тому

    thank you for the explanation!!

  • @SamiyuruSenarathna
    @SamiyuruSenarathna 6 років тому

    Very clear explanation.

  • @גלחביב-ק5ח
    @גלחביב-ק5ח 6 років тому +1

    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.

  • @yuqian822
    @yuqian822 5 років тому +1

    Thank you so much. This tutorial helps me a lot

  • @MarcosVinic
    @MarcosVinic 5 років тому +1

    Thank you this video is amazing.

  • @cooler14270
    @cooler14270 3 роки тому

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

    • @nayjer2576
      @nayjer2576 2 роки тому +1

      Good observation, the product register should hold 65 bit then to hold the carry :)

    • @ProSpase
      @ProSpase Рік тому

      15 x 15 = 225 still fits in an 8 bit number

  • @mspeir
    @mspeir 5 років тому

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

    • @moatef1886
      @moatef1886 3 роки тому +1

      This can be done and requires the use of additional circuitry or multiplexer.

  • @ralphramirez7504
    @ralphramirez7504 Рік тому

    can you stop sleeping the video