Design a 24-bit mutiplier
I am designing a multiplier circuit using a modified Booth algorithm, I examine a group of 3 bits, to generate a partial product, so I have a total of 13 partial product. The product will be 48-bit. I'm stuck on the track amount. My idea is to use a 48bit adder sum Curry LOOKAHEAD al partial product, but it seems to waste. Is there any other way to effectively summarize all 13 partial products.