Flowchart for Unsigned Binary Multiplication

SHIFT AND ADD MULTIPLIER:

Contd..

GENERAL MULTIPLICATION

BRAUN MULTIPLER:

PERFORMA
NCE
: well for unsigned operands
Performs

less than 16

bits, in terms of speed, power and area.

Simple and regular structure as compared to the

other multiplier schemes.
The number of components required is increases
quadratically with the number of bits.

SPEED CONSIDERATION:

The delay of the braun multiplier is dependent on the

delay of the full adder cell and also on the final adder
in the last row.

The sum and carry delay are desirable because they bo

in critical path

t braun=(n-1) t carry-save +t and + (n-1) t ripple-carry