196

16504 readers

1420 users here now

Be sure to follow the rule before you head out.

Rule: You must post before you leave.

founded 1 year ago

MODERATORS

478

submitted 3 months ago by laserm@lemmy.world to c/196@lemmy.blahaj.zone

70 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] polonius-rex@kbin.run 5 points 3 months ago (2 children)

is that how the alu performs multiplication? with a binary adder?

[–] DumbAceDragon@sh.itjust.works 8 points 3 months ago* (last edited 3 months ago) (3 children)

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

[–] polonius-rex@kbin.run 3 points 3 months ago

this makes sense

[–] Barbarian@sh.itjust.works 3 points 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)

[–] Tryptaminev@lemm.ee 2 points 3 months ago

Shouldn't you be able to get away with two 2n bit adders and recursion?

[–] Phoenix3875@lemmy.world 1 points 3 months ago

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.