this post was submitted on 27 Jul 2024
481 points (100.0% liked)

196

16509 readers
2285 users here now

Be sure to follow the rule before you head out.

Rule: You must post before you leave.

^other^ ^rules^

founded 1 year ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 5 points 3 months ago (2 children)

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

[–] [email protected] 1 points 3 months ago (1 children)

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.

[–] [email protected] 1 points 3 months ago

Gosh, time to rebuild my ALU again..

[–] [email protected] 9 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

[–] [email protected] 2 points 3 months ago

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

[–] [email protected] 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)

[–] [email protected] 3 points 3 months ago

this makes sense