Академический Документы
Профессиональный Документы
Культура Документы
Introduction:
Scope of Work:
In order to achieve high speed of operation in multiplication, the trend is to resort
to Parallel Multipliers. However, the performance of the multiplier is determined
by number of partial products to be added. In this paper we identify and optimize
the critical path that determines the maximum delay in parallel multipliers. A
brief look into the standard architectures like Array Multipliers, Wallace Tree
Multiplier and Baug Wooley Multiplier is undertaken, specifically with respect to
estimating and minimizing power dissipation due to the shrinking of technology
all the way to the sub-micron level in manufacturing the chips. Power
consumption can be reduced through suitable methods such as gate-level
optimization, increasing gate oxide thickness in non-critical paths, etc.
A. Array Multipliers
Fig. 1 illustrates the Array Multiplier. With its good structure, this multiplier
is based on the standard add and shift operations. Each partial product is
generated by taking into account the multiplicand and one bit of multiplier
each time. The impending addition is carried out by high-speed carry-save
algorithm and the final product is obtained employing any fast adder – the
number of partial products depends upon the number of multiplier bits. To
accommodate the positive and negative values of the multiplier and
multiplicands, sign bit extension has to be done at the appropriate stage. The
sign bit extension will result in higher capacitive load and will result in more
power consumption and due to increase capacitive load it will lead to reducing
the speed of operation.