Professional Documents
Culture Documents
10 Chapter 5
10 Chapter 5
THE MULTIPLIER
5.1 INTRODUCTION
Multiplications are very expensive and slows the over all operation. The
performance of many computational problems are often dominated by the speed at
which a multiplication operation can be executed. Consider two unsigned binary
numbers X and Y that are M and N bits wide, respectively. To introduce the
multiplication operation, it is useful to express X and Y in the binary
representation
X = Σ Xi 2i i = 0 to M (5.1)
Y = Σ Yj 2j j = 0 to N (5.2)
Z = X x Y = Σ Zk 2k k = 0 to M + N – 1 (5.3)
= (Σ Xi 2i i = 0 to M ) (Σ Yj 2j j = 0 to N) (5.4)
= Σ (Σ Xi Yj 2i+j) i = 0 to M-1, j = 0 to N-1 (5.5)
The simplest parallel multiplier is the Braun array. All the partial
products are computed in parallel, then collected through a cascade of Carry Save
Adders. The completion time is limited by the depth of the carry save array, and
by the carry propagation in the adder. Note that this multiplier is only suited for
positive operands. The structure of the Braun algorithm for the unsigned binary
multiplication is shown in figure 5.4.
‘0’ F F F F
A(n)
F
B[n]
‘0’ F F F F
CARRY
SUM
‘0’ F F F F
‘0’ F F F F
F F F F ‘0’
P7 P6 P5 P4 P3 P2 P1 P0