Arithmetic Circuits-2

•
Multipliers

–
Array multipliers

•
Shifters

–
Barrel shifter

–
Logarithmic shifter

ECE 261 Krish Chakrabarty 1

Binary Multiplication

M-1
N-1

X =
Xi 2i

Yi 2i

Y = i=0

i=0

Multiplicand
Multiplier

Product
Z = X * Y

N-1
M-1


(
XiYj2i+j)

= i=0

j=0

Partial products

•
Product = Sum of partial products

ECE 261 Krish Chakrabarty 2

1
 Multiplication

•
Example:

ECE 261 Krish Chakrabarty 3

Multiplication

•
Example:

ECE 261 Krish Chakrabarty 4

2
 Multiplication

•
Example:

ECE 261 Krish Chakrabarty 5

Multiplication

•
Example:

ECE 261 Krish Chakrabarty 6

3
 Multiplication

•
Example:

ECE 261 Krish Chakrabarty 7

Multiplication

•
Example:

ECE 261 Krish Chakrabarty 8

4
 Multiplication

•
Example:

•
M x N-bit multiplication

–
Produce N M-bit partial products

–
Sum these to produce M+N-bit product

ECE 261 Krish Chakrabarty 9

The Binary Multiplication

1 0 1 0 1 0 Multiplicand

1
0
1
1
Multiplier

1 0 1 0 1 0













AND operation

1
0
1
0
1
0

Partial Products

0
0
0
0
0
0

+
1
0
1
0
1
0

1 1 1 0 0 1 1 1 0

ECE 261 Krish Chakrabarty 10

5
 General Form

•
Multiplicand:
Y = (yM-1, yM-2, …, y1, y0)

•
Multiplier:
X = (xN-1, xN-2, …, x1, x0)

•
Product:

ECE 261 Krish Chakrabarty 11

Dot Diagram

•
Each dot represents a bit

ECE 261 Krish Chakrabarty 12

6
 The Array Multiplier
x3
x2
x1
x0

y0

x3
x2
x1
x0

y1


Z0

HA  FA  FA HA
x3
x 2
x 1
x0
y 2


Z1

FA FA  FA  HA

Z2
FA: Full adder

x3
x2
x1
x0
y3

HA: Half adder

(two inputs)


FA FA FA  HA 
Z7 Z6 Z5 
Z4 
Z3
Propagation delay = ?

ECE 261 Krish Chakrabarty 13

The MxN Array Multiplier

— Critical Path

HA 
FA 
FA 
HA


FA 
FA FA 
HA   
Critical P ath 1
  
Critical P ath 2
Critical Path 1 & 2


FA 
FA 
FA HA

ECE 261 Krish Chakrabarty 14

7
 Carry-Save Multiplier

HA




HA


HA HA





HA


FA


FA


FA

Carries saved for next

HA




FA


FA


FA
adder stage

HA




FA


FA


HA Unique critical path

Trade offs?

ECE 261 Krish Chakrabarty 15

Adder Cells in Array Multiplier

P








VDD
A


Ci
VDD

A
A
P


P S



Ci

A







B B P




VDD
V DD


P A



Ci

Ci


P Co


A


Ci

e
n
t

i
ca

l
De
l

a
y
s
fo

r
Ca

rr
y

an
d

Su
m

Id



P

ECE 261 Krish Chakrabarty 16

8
 Multiplier Floorplan

X3




X2 X1




X0

Y0



























HA Mul ti pl i e r Ce l l
Y1
C S C S C S C S



Z0

F A Mul ti pl i e r Ce l l



Y2









C S C S C S C S



Z1

















V e c to r Me r g i ng Ce l l

Y3
C S C S C S C S



Z2
X and Y s i g nal s ar e br o adc as te d
thr o ug h the c o mpl e te ar r ay .

C


S
C






S
C
S
C
S

Z7


Z6






Z5 Z4 Z3

ECE 261 Krish Chakrabarty 17

Multipliers —Summary

•
O
p
t
i
m
i
z
a
t
i
o
n
G
o
a
l
s
D
i
f
f
e
re

n
t
V
s
B
i
n
a
ry

A
d
d
e
r

•
O
n
c
e
A
g
a
i
n
:
Id


e
n
t
i
f
y
C
ri

t
i
c
a
l
P
a
t
h

•
O
t
h
e
r
p
o
s
s
i
b
l
e
t
e
c
h
n
i
q
u
e
s

-
Lo

g
a
ri

t
h
m
i
c
v
e
rs

u
s
Li

n
e
a
r
(Wallace tree

multiplier)

-
D
a
t
a
e
n
c
o
d
i
n
g
(
B
o
o
t
h
)

-
P
i
p
e
l
i
n
i
n
g

ECE 261 Krish Chakrabarty 18

9
 Comparators

•
0’s detector:

A = 00…000

•
1’s detector:

A = 11…111

•
Equality comparator:
A = B

•
Magnitude comparator:
A < B

ECE 261 Krish Chakrabarty 19

1’s & 0’s Detectors

•
1’s detector: N-input AND gate

•
0’s detector: NOTs + 1’s detector (N-input NOR)

ECE 261 Krish Chakrabarty 20

10
 Equality Comparator

•
Check if each bit is equal (XNOR, aka equality
gate)

•
1’s detect on bitwise equality

ECE 261 Krish Chakrabarty 21

Magnitude Comparator

•
Compute B-A and look at sign

•
B-A = B + ~A + 1

•
For unsigned numbers, carry out is sign bit

ECE 261 Krish Chakrabarty 22

11
 Shifters

•
Logical Shift:

–
Shifts number left or right and fills with 0’s

•
1011 LSR 1 = 0101
1011 LSL1 = 0110

•
Arithmetic Shift:

–
Shifts number left or right. Rt shift sign extends

•
1011 ASR1 = 1101
1011 ASL1 = 0110

•
Rotate:

–
Shifts number left or right and fills with lost bits

•
1011 ROR1 = 1101
1011 ROL1 = 0111

ECE 261 Krish Chakrabarty 23

The Binary Shifter

no

p
Le
f
t


Right
One-bit shifts

Ai

Bi

Ai-1



Bi-1

Bi


t-
S

l

i
ce

i

ECE 261 Krish Chakrabarty 24

12
 Multi-bit Shifters

•
Cascade one-bit shifters?

•
Complex, unwieldy, slow for larger number of
shifts

•
Two other types of shifters

–
Barrel shifter

–
Logarithmic shifter

ECE 261 Krish Chakrabarty 25

The Barrel Shifter

A3



B3
Shift by 0 to







S h1 3 bits

A2



B2

A1
S h2

B1










: Da ta Wire

: Co ntro l Wire

A0
S h3

B0

S h0 S h1 S h2 S h3

ECE 261 Krish Chakrabarty 26

13
 The Barrel Shifter

•
Area dominated by wiring

•
Propagation delay is theoretically constant (at most one

transmission gate), independent of shifter size, no. of

shifts

•
Reality: Capacitance on buffer input
maximum shift
width

ECE 261 Krish Chakrabarty 27

4x4 barrel shifter

A3


A2


A


1

A0

Sh0



Sh1



Sh2



Sh3


ff
e
r


Bu
Widthbarrel ~ 2 pm M
pm = metal/poly pitch

M = no. of shifts

ECE 261 Krish Chakrabarty 28

14
 Logarithmic Shifter

•
Staged approach, e.g. 7 = 1 + 2 + 4, 5 = 1 + 0 + 4

•
Shifter with maximum shift width M consists of log2M stages








Sh1 Sh1






Sh2 Sh2






Sh4 Sh4

A3


B3

A2


B2

A1


B1

A0


B0

ECE 261 Krish Chakrabarty 29

0-7 bit Logarithmic Shifter

A
3
Out3

A
2
Out2

A
1
Out1

A
0
Out0

ECE 261 Krish Chakrabarty 30

15