12. Implementing Multiplication

Поділитися
Вставка
  • Опубліковано 11 січ 2025

КОМЕНТАРІ • 28

  • @AndrewDouglasMcdowell
    @AndrewDouglasMcdowell Рік тому +8

    Thank you so much, even 6 years later this video is helping CS students who didn't get great professors.

  • @azzam7239
    @azzam7239 2 роки тому +3

    I love how clear these explanations are. Much love from Egypt.

  • @jackobkahlon32
    @jackobkahlon32 3 роки тому +2

    Thank you Padraic for your great lectures.
    Regards,
    Yakov.

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

    Thank you very much. Very nice, clear, and right-to-the-point explanation. This and your other videos helped me a lot in my computer architecture class. I'm going to look into your other videos/playlists. Thanks again.

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

    thankyou so much. where do you teach? i love your explanation

  • @borriskarlov8140
    @borriskarlov8140 6 років тому +1

    your videos are GREAT!!

  • @KevinskyChen
    @KevinskyChen 2 роки тому

    Very Clear !!! Thank you professor~

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

    this is very clear explanation

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

    Thanks for the clear explanation!!

  • @chipxprt
    @chipxprt 6 місяців тому

    You didnt consider carry out in the shift right operation, so thats going to be a problem for some numbers. Try multiplying binary equivalent of 14x13

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

    could you please do signed multiplication hardware?Thank you

  • @CSparzo
    @CSparzo 6 років тому +1

    Great tutor

  • @yasser_khouader
    @yasser_khouader 4 роки тому

    does anyone know some book that can be useful?

  • @PalashKantiKundu
    @PalashKantiKundu 2 роки тому

    Made my concepts clear

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

    very well explained ty sir

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

    What happens when the most significant bit of the multiplicand is 1? The moment you shift it to the left, you lose the value and your product is scrap.

    • @quietpanther
      @quietpanther 5 років тому +3

      That's why the register for the multiplicand is twice the size of the largest value it's designed to handle. For a 32-bit architecture, the register for the multiplicand will be 64 bits, allowing the number to be shifted left 32 times (once for each bit in the 32-bit multiplier) without losing any data. For a 64-bit architecture, the register for the multiplicand is 128 bits.

  • @osctelum
    @osctelum 2 роки тому

    I would favorite this video if I could. Very clear.

  • @sathvikswaminathan7933
    @sathvikswaminathan7933 4 роки тому

    why dont we just stop when the multiplier register becomes 0?

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

    Isn't the second addition (ignored one) wrong?

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

    Great explanation
    THANK YOU :)))))))))))))))))))))))))))))))))))

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

    Excellent!

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

    ty man

  • @andrejshumkovski5680
    @andrejshumkovski5680 4 роки тому

    Thank you

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

    thx alot

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

    you seem very blocked up prof! anyways, great explanation

  • @Decco6306
    @Decco6306 4 роки тому +7

    this dude got A L L E R G I E S