Pipelining the Multiplier

• Register cost:

  • all of multiplicand: (N bits/stage * M stages)
  • Multiplier: (M2 + M) / 2 bits
  • Early output values: (M2 + M) / 2 bits
  • Total: M (N + M + 1) bits

• Critical path = max:

  • DFF + FA + setup
  • Bottom adder

Previous slide

Next slide

Back to first slide

View graphic version