Datapath Functional Units
description
Transcript of Datapath Functional Units
![Page 1: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/1.jpg)
Datapath Functional Units
Adapted from David Harris of
Harvey Mudd College
![Page 2: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/2.jpg)
2
Outline Comparators Shifters Multi-input Adders Multipliers
![Page 3: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/3.jpg)
3
Comparators 0’s detector: A = 00…000 1’s detector: A = 11…111 Equality comparator: A = B Magnitude comparator: A < B
![Page 4: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/4.jpg)
4
1’s & 0’s Detectors 1’s detector: N-input AND gate 0’s detector: NOTs + 1’s detector (N-input NOR)
A0
A1
A2
A3
A4
A5
A6
A7
allones
A0
A1
A2
A3
allzeros
allones
A1
A2
A3
A4
A5
A6
A7
A0
![Page 5: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/5.jpg)
5
Equality Comparator Check if each bit is equal (XNOR, aka equality gate) 1’s detect on bitwise equality
A[0]B[0]
A = B
A[1]B[1]
A[2]B[2]
A[3]B[3]
![Page 6: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/6.jpg)
6
Magnitude Comparator Compute B-A and look at sign B-A = B + ~A + 1 For unsigned numbers, carry out is sign bit
A0
B0
A1
B1
A2
B2
A3
B3
A = BZ
C
A B
N A B
![Page 7: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/7.jpg)
7
Signed vs. Unsigned For signed numbers, comparison is harder
– C: carry out– Z: zero (all bits of A-B are 0)– N: negative (MSB of result)– V: overflow (inputs had different signs, output sign B)
![Page 8: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/8.jpg)
8
Shifters Logical Shift:
– Shifts number left or right and fills with 0’s• 1011 LSR 1 = ____ 1011 LSL1 = ____
Arithmetic Shift:– Shifts number left or right. Rt shift sign extends
• 1011 ASR1 = ____ 1011 ASL1 = ____ Rotate:
– Shifts number left or right and fills with lost bits• 1011 ROR1 = ____ 1011 ROL1 = ____
![Page 9: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/9.jpg)
9
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
![Page 10: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/10.jpg)
10
Funnel Shifter A funnel shifter can do all six types of shifts Selects N-bit field Y from 2N-bit input
– Shift by k bits (0 k < N)
B C
offsetoffset + N-1
0N-12N-1
Y
![Page 11: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/11.jpg)
11
Funnel Shifter Operation
Computing N-k requires an adder
![Page 12: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/12.jpg)
12
Funnel Shifter Operation
Computing N-k requires an adder
![Page 13: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/13.jpg)
13
Funnel Shifter Operation
Computing N-k requires an adder
![Page 14: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/14.jpg)
14
Funnel Shifter Operation
Computing N-k requires an adder
![Page 15: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/15.jpg)
15
Funnel Shifter Operation
Computing N-k requires an adder
![Page 16: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/16.jpg)
16
Simplified Funnel Shifter Optimize down to 2N-1 bit input
![Page 17: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/17.jpg)
17
Simplified Funnel Shifter Optimize down to 2N-1 bit input
![Page 18: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/18.jpg)
18
Simplified Funnel Shifter Optimize down to 2N-1 bit input
![Page 19: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/19.jpg)
19
Simplified Funnel Shifter Optimize down to 2N-1 bit input
![Page 20: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/20.jpg)
20
Simplified Funnel Shifter Optimize down to 2N-1 bit input
![Page 21: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/21.jpg)
21
Funnel Shifter Design 1 N N-input multiplexers
– Use 1-of-N hot select signals for shift amount
– nMOS pass transistor design (Vt drops!)k[1:0]
s0s1s2s3Y3
Y2
Y1
Y0
Z0Z1Z2Z3Z4
Z5
Z6
left Inverters & Decoder
![Page 22: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/22.jpg)
22
Funnel Shifter Design 2 Log N stages of 2-input muxes
– No select decoding needed
Y3
Y2
Y1
Y0Z0
Z1
Z2
Z3
Z4
Z5
Z6
k0k1
left
![Page 23: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/23.jpg)
23
Multi-input Adders Suppose we want to add k N-bit words
– Ex: 0001 + 0111 + 1101 + 0010 = _____
![Page 24: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/24.jpg)
24
Multi-input Adders Suppose we want to add k N-bit words
– Ex: 0001 + 0111 + 1101 + 0010 = 10111
![Page 25: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/25.jpg)
25
Multi-input Adders Suppose we want to add k N-bit words
– Ex: 0001 + 0111 + 1101 + 0010 = 10111 Straightforward solution: k-1 N-input CPAs
– Large and slow
+
+
0001 0111
+
1101 0010
10101
10111
![Page 26: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/26.jpg)
26
Carry Save Addition A full adder sums 3 inputs and produces 2 outputs
– Carry output has twice weight of sum output N full adders in parallel are called carry save adder
– Produce N sums and N carry outsZ4Y4X4
S4C4
Z3Y3X3
S3C3
Z2Y2X2
S2C2
Z1Y1X1
S1C1
XN...1 YN...1 ZN...1
SN...1CN...1
n-bit CSA
![Page 27: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/27.jpg)
27
CSA Application Use k-2 stages of CSAs
– Keep result in carry-save redundant form Final CPA computes actual result
4-bit CSA
5-bit CSA
0001 0111 1101 0010
+
10110101_
0001 0111+1101 10110101_
XYZSC
0101_ 1011 +0010
XYZSC
ABS
![Page 28: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/28.jpg)
28
CSA Application Use k-2 stages of CSAs
– Keep result in carry-save redundant form Final CPA computes actual result
4-bit CSA
5-bit CSA
0001 0111 1101 0010
+
10110101_
01010_ 00011
0001 0111+1101 10110101_
XYZSC
0101_ 1011 +0010 0001101010_
XYZSC
01010_+ 00011
ABS
![Page 29: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/29.jpg)
29
CSA Application Use k-2 stages of CSAs
– Keep result in carry-save redundant form Final CPA computes actual result
4-bit CSA
5-bit CSA
0001 0111 1101 0010
+
10110101_
01010_ 00011
0001 0111+1101 10110101_
XYZSC
0101_ 1011 +0010 0001101010_
XYZSC
01010_+ 00011 10111
ABS
10111
![Page 30: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/30.jpg)
30
Multiplication Example: 1100 : 1210
0101 : 510
![Page 31: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/31.jpg)
31
Multiplication Example: 1100 : 1210
0101 : 510 1100
![Page 32: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/32.jpg)
32
Multiplication Example: 1100 : 1210
0101 : 510 1100 0000
![Page 33: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/33.jpg)
33
Multiplication Example: 1100 : 1210
0101 : 510 1100 0000 1100
![Page 34: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/34.jpg)
34
Multiplication Example: 1100 : 1210
0101 : 510 1100 0000 1100 0000
![Page 35: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/35.jpg)
35
Multiplication Example: 1100 : 1210
0101 : 510 1100 0000 1100 000000111100 : 6010
![Page 36: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/36.jpg)
36
Multiplication Example:
M x N-bit multiplication– Produce N M-bit partial products– Sum these to produce M+N-bit product
1100 : 1210 0101 : 510 1100 0000 1100 000000111100 : 6010
multiplier
multiplicand
partialproducts
product
![Page 37: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/37.jpg)
37
General Form Multiplicand: Y = (yM-1, yM-2, …, y1, y0)
Multiplier: X = (xN-1, xN-2, …, x1, x0)
Product:
1 1 1 1
0 0 0 0
2 2 2M N N M
j i i jj i i j
j i i j
P y x x y
x0y5 x0y4 x0y3 x0y2 x0y1 x0y0
y5 y4 y3 y2 y1 y0
x5 x4 x3 x2 x1 x0
x1y5 x1y4 x1y3 x1y2 x1y1 x1y0
x2y5 x2y4 x2y3 x2y2 x2y1 x2y0
x3y5 x3y4 x3y3 x3y2 x3y1 x3y0
x4y5 x4y4 x4y3 x4y2 x4y1 x4y0
x5y5 x5y4 x5y3 x5y2 x5y1 x5y0
p0p1p2p3p4p5p6p7p8p9p10p11
multiplier
multiplicand
partialproducts
product
![Page 38: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/38.jpg)
38
Dot Diagram Each dot represents a bit
partial products
multiplier x
x0
x15
![Page 39: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/39.jpg)
39
Array Multipliery0y1y2y3
x0
x1
x2
x3
p0p1p2p3p4p5p6p7
B
ASin Cin
SoutCout
BA
CinCout
Sout
Sin
=
CSAArray
CPA
critical path BA
Sout
Cout CinCout
Sout
=Cin
BA
![Page 40: Datapath Functional Units](https://reader036.fdocuments.net/reader036/viewer/2022062322/56814963550346895db6b8f2/html5/thumbnails/40.jpg)
40
Rectangular Array Squash array to fit rectangular floorplan
y0y1y2y3
x0
x1
x2
x3
p0
p1
p2
p3
p4p5p6p7