laserm@lemmy.world to 196@lemmy.blahaj.zone · 3 months agoelectrical engineer rulelemmy.worldimagemessage-square68fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageelectrical engineer rulelemmy.worldlaserm@lemmy.world to 196@lemmy.blahaj.zone · 3 months agomessage-square68fedilink
minus-squarepolonius-rex@kbin.runlinkfedilinkarrow-up0·3 months agois that how the alu performs multiplication? with a binary adder?
minus-squareDumbAceDragon@sh.itjust.workslinkfedilinkEnglisharrow-up0·edit-23 months agoYes. Typically, to multiply two n-bit numbers, you need n - 1 n-bit adders. You basically do long multiplication. I’d upload an image but either voyager or my instance won’t let me for some reason, so sorry if this doesn’t embed right
minus-squareBarbarian@sh.itjust.workslinkfedilinkarrow-up0·3 months ago I’d upload an image but either voyager or my instance won’t let me for some reason, so sorry if this doesn’t embed right Embedded just fine on my end (Jerboa)
minus-squareTryptaminev@lemm.eelinkfedilinkarrow-up0·3 months agoShouldn’t you be able to get away with two 2n bit adders and recursion?
minus-squarePhoenix3875@lemmy.worldlinkfedilinkarrow-up0·3 months agoConceptually yes, but you can achieve better efficiency by putting multiple adders together with e.g. a Wallace tree. There are more efficient ways to expand adders than simply chaining them as well.
is that how the alu performs multiplication? with a binary adder?
Yes. Typically, to multiply two n-bit numbers, you need n - 1 n-bit adders. You basically do long multiplication.
I’d upload an image but either voyager or my instance won’t let me for some reason, so sorry if this doesn’t embed right
this makes sense
Embedded just fine on my end (Jerboa)
Shouldn’t you be able to get away with two 2n bit adders and recursion?
Conceptually yes, but you can achieve better efficiency by putting multiple adders together with e.g. a Wallace tree.
There are more efficient ways to expand adders than simply chaining them as well.