Question

Prove the worst case delay through an n*n array multiplier is 6(n-1)-1 gate delays

Answer 1

For an n -bit array multiplier, the vertical and horizontal delays are both the same as the ... in eq (1), it carries out the multiplication in two steps: 0 1 2 3 4 5 6 7 0 1 2 3 0 1 2 3 z z z z ...