Advanced Digital Design

Lecture 14: Datapath Component: Multiplier Architecture

Partial Product Reduction Schemes for high speed multipliers

Carry Save Reduction Scheme Dual Carry Save Reduction Scheme Wallace Tree Reduction Scheme Dadda Tree Reduction Scheme

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

12x12 Carry Save Reduction Scheme

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Dual Carry Save Reduction

In dual carry save reduction scheme, the partial products are divided into 2 equal size groups The carry save reduction scheme is applied on both the groups simultaneously This results into two partial product layers in each group

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Wallace Tree Multipliers

Grouping the partial products into groups of three carries out the reduction Unlike linear time arrays, these partial product groups are reduced simultaneously through carry save addition technique Each partial product row spits out two rows These rows then, with other rows from other partial product groups, form a reduced matrix This process continues until only two rows are left At this stage, no further reduction is done The final rows are added together for the final product
Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Adder Levels in Wallace Tree Reduction Scheme

Number of partial Products 3 4 5n6 7n9 10 n 13 14 n 19 20 n 28 29 n 42 43 n 63 Number of full adder Levels 1 2 3 4 5 6 7 8 9

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Dada Tree Reduction

Also a member of the log time array multipliers since it is a modified version of the Wallace tree Dadda tree works exactly the same as the Wallace tree Requires the same number of adder levels It uses less number of computational elements as compared to Wallace tree

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Dada Tree Reduction

To understand the working logic of Dadda tree, consider the following sequence from Wallace Tree reduction scheme table 2, 3, 4, 6, 9, 13, 19, 28, Each number represents the number of partial products remaining at each level of addition The sequence says that 2 partial products can be obtained from at the most 3 partial products 3 can be obtained from 4 4 from 6 and so on
Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

2s Complement Signed Multiplier

Signed Multiplication:
Remember for 2s complement numbers MSB has negative weight:

X = xi 2i xn 1 2 n 1
i =0

N 2

ex: -6 = 110102 = 020 + 121 + 022 + 123 - 124 = 0 + 2 + 0 + 8 - 16 = -6

We need to sign-extend pp and subtract final pp for signed multiplication?

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Sign Extension
SXXXXXXXXXX SXXXXXXXXXX SXXXXXXXXXX SXXXXXXXXXX SXXXXXXXXXX SXXXXXXXXXX 000000XXXXXXXXXX 00000XXXXXXXXXX 0000XXXXXXXXXX 000XXXXXXXXXX 00XXXXXXXXXX 0XXXXXXXXXX 111111XXXXXXXXXX 11111XXXXXXXXXX 1111XXXXXXXXXX 111XXXXXXXXXX 11XXXXXXXXXX 1XXXXXXXXXX

IF S =0

S = S ign bit S = 0 : P os itive S = 1 : Ne ga tive

IF S =1

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Sign extension via padding of 1s to the left

B is positive (S=0) B=0 0 0 0 0 0 . 1 1 0 1 0 1 1 B=1 1 1 1 1 0 . 1 1 0 1 0 1 1 1 + 000000.1101011

B is positive (S=1) B=1 1 1 1 1 1 . 1 1 0 1 0 1 1 B=1 1 1 1 1 1 . 1 1 0 1 0 1 1 1 + 111111.1101011

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Sign Extension Elimination

1111111 111111SXXXXXXXXXX 11111SXXXXXXXXXX 1111SXXXXXXXXXX 111SXXXXXXXXXX 11SXXXXXXXXXX 1SXXXXXXXXXX SXXXXXXXXXX SX XX XX XX XX XX 1 X X X X X X X X X X X X X X X X X X X X X X X X X X X X X 111111 11111 1111 111 11 1 1000001

Sign extension correction vector

S SX SXX 10 00

S X X X 0

S X X X X 0

XXXX XXX XX X

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Correction Vector Computation

111111 11111SXXXXXXXXXX 1111SXXXXXXXXXX 111SXXXXXXXXXX 11SXXXXXXXXXX 1SXXXXXXXXXX SXXXXXXXXXX 1 1 1 1 1 1 1 10 1 1 1 1 1 1111 111 11 1 1

Complementing last partial product

0000100001

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Example: Singed x signed

CV: 0010_000
Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

String Property

7=111=8-1=1001 31= 1 1 1 1 1 =32-1

--

Or 1 0 0 0 0 1=32-1=31 Replace string of 1s in multiplier with

In

a string when ever we have the least significant 1, we put a bar on it We go to the end of the string We replace all the 1(s) with 0 We put a 1 where the string ends
Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Example 00111101101111011101 00111101101111100101 00111101110000100101 00111110010000100101 01000010010000100101

Hence the number of 1(s) has reduced from 14 to 6. Both have the same value.
String String String String

Booth recoding property.

makes

use

of

the

string

Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE

Sessional Results
Average is 56.3 St. Dev is 22 Lowest is 16 Highest is 95

results
Advanced Digital Design Fall 2004 Lecture 14 Delivered By M. Mohsin Rahmatullah @ CASE