Array Multiplier

Fixed $n\times n$ size. Like Grade 3 math !

• Observe how the top number is “multiplied” to the first, second, and third number. Then all of these results are summed.

Generally speaking it looks like this: You just add up all the columns… we know how to add! In implementation it looks a bit… you’ll see

I do not know why the and of are there

• The calculations happen in 1 cycle! Combinational circuit indeed: O(1) clock cycles
• The size is really big though: $O(N^2)$
  • One 4-bit multiplier already needs 12 FA’s. That is a lot!
  • 32 bits would be even crazier