8. design of adders - university of texas at austinjaa/vlsi/lectures/8-1.pdfdesign of adders jacob...
TRANSCRIPT
![Page 1: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/1.jpg)
8. Design of Adders
Jacob Abraham
Department of Electrical and Computer EngineeringThe University of Texas at Austin
VLSI DesignFall 2020
September 22, 2020
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 1 / 31
![Page 2: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/2.jpg)
Single-Bit Addition
Half AdderS = A⊕BCout = A ·B
A B Cout S
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0
Full Adder
S = A⊕B ⊕ CCout = MAJ(A,B,C)
A B C Cout S
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 1 / 31
![Page 3: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/3.jpg)
Full Adder Design I
Brute force implementation from equationsS = A⊕B ⊕ CCout = MAJ(A,B,C)
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 2 / 31
![Page 4: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/4.jpg)
Full Adder Design II
Factor S in terms of Cout
S = A ·B · C + (A+B + C) · Cout
Critical path is usually C to Cout in ripple adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 3 / 31
![Page 5: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/5.jpg)
Layout of Full Adder
Clever layout circumvents usual line of diffusion
Use wide transistors on critical pathEliminate output inverters
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 4 / 31
![Page 6: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/6.jpg)
Full Adder Design III
Complementary Pass Transistor Logic (CPL)
Slightly faster, but more area
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 5 / 31
![Page 7: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/7.jpg)
Ripple Carry Adder
Simplest design: cascade full adders
Critical path goes from Cin to Cout
Design full adder to have fast carry (small delay for carrysignal)
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 6 / 31
![Page 8: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/8.jpg)
Deal with Inversions to Speed Up Carry Path
Critical path passes through majority gate
Built from minority + inverterEliminate inverter and use inverting full adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 7 / 31
![Page 9: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/9.jpg)
Carry Propagate Adders
N-bit adder called CPA
Each sum bit depends on all previous carriesHow do we compute all these carries quickly?
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 8 / 31
![Page 10: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/10.jpg)
Carry Propagate, Generate, Kill (P, G, K)
For a full adder, define what happens to carries
Generate: Cout = 1, independent of C
G = A ·BPropagate: Cout = C
P = A⊕B
Kill: Cout = 0, independent of C
K = A ·B
Generate and Propagate for groups spanning i:j
Gi:j = Gi:k + Pi:k ·Gk−1:j
Pi:j = Pi:k · Pk−1:j
Base Case
Gi:i ≡ Gi = Ai ·Bi, G0:0 = G0 = Cin
Pi:i ≡ Pi = Ai ⊕Bi, P0:0 = P0 = 0
Sum: Si = Pi ⊕Gi−1:0
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 9 / 31
![Page 11: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/11.jpg)
Carry Propagate, Generate, Kill (P, G, K)
For a full adder, define what happens to carries
Generate: Cout = 1, independent of C
G = A ·BPropagate: Cout = C
P = A⊕B
Kill: Cout = 0, independent of C
K = A ·B
Generate and Propagate for groups spanning i:j
Gi:j = Gi:k + Pi:k ·Gk−1:j
Pi:j = Pi:k · Pk−1:j
Base Case
Gi:i ≡ Gi = Ai ·Bi, G0:0 = G0 = Cin
Pi:i ≡ Pi = Ai ⊕Bi, P0:0 = P0 = 0
Sum: Si = Pi ⊕Gi−1:0
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 10 / 31
![Page 12: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/12.jpg)
PG Logic
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 11 / 31
![Page 13: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/13.jpg)
Ripple Carry Adder Revisited in the PG Framework
Gi:0 = Gi + Pi ·Gi−1:0
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 12 / 31
![Page 14: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/14.jpg)
Ripple Carry PG Diagram
tripple = tpg + (N − 1)tAO + txor
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 13 / 31
![Page 15: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/15.jpg)
PG Diagram Notation
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 14 / 31
![Page 16: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/16.jpg)
Carry-Skip Adder
Carry-ripple is slow through all N stages
Carry-skip allows carry to skip over groups of n bits
Decision based on n-bit propagate signal
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 15 / 31
![Page 17: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/17.jpg)
Carry-Skip PG Diagram
For k n-bit groups (N = nk)tskip = tpg + [2(n− 1) + (k − 1)] tAO + txor
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 16 / 31
![Page 18: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/18.jpg)
Carry-Lookahead Adder (CLA)
Carry-lookahead adder computes Gi:0 for many bits in parallel
Uses higher-valency cells with more than two inputs
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 17 / 31
![Page 19: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/19.jpg)
CLA PG Diagram
Higher Valency Cells
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 18 / 31
![Page 20: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/20.jpg)
Carry-Select Adder
Trick for critical paths dependent on late input X
Precompute two possible outputs for X = 0, 1Select proper output when X arrives
Carry-select adder precomputes n-bit sums for both possiblecarries into n-bit group
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 19 / 31
![Page 21: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/21.jpg)
Tree Adders
Tree structures can be used to speed up computations
Look at computing the XOR of 8 bits using 2-input XOR-gates
If lookahead is good for adders, lookahead across lookahead!Recursive lookahead gives O(log N) delay
Many variations on tree adders
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 20 / 31
![Page 22: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/22.jpg)
Brent-Kung Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 21 / 31
![Page 23: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/23.jpg)
Sklansky Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 22 / 31
![Page 24: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/24.jpg)
Kogge-Stone Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 23 / 31
![Page 25: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/25.jpg)
Tree Adder Taxonomy
Ideal N-bit tree adder would have
L = log N logic levelsFanout never exceeding 2No more than one wiring track between levels
Describe adder with 3-D taxonomy (l, f, t)
Logic levels: L+ lFanout: 2f + 1Wiring tracks: 2t
Known tree adders sit on plane defined by l + f + t = L− 1
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 24 / 31
![Page 26: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/26.jpg)
Tree Adder Taxonomy, Cont’d
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 25 / 31
![Page 27: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/27.jpg)
Han-Carlson Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 26 / 31
![Page 28: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/28.jpg)
Brent-Kung Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 27 / 31
![Page 29: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/29.jpg)
Knowles [2,1,1,1] Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 28 / 31
![Page 30: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/30.jpg)
Ladner-Fischer Adder
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 29 / 31
![Page 31: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/31.jpg)
Tree Adder Taxonomy Revisited
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 30 / 31
![Page 32: 8. Design of Adders - University of Texas at Austinjaa/vlsi/lectures/8-1.pdfDesign of Adders Jacob Abraham, September 22, 2020 24 / 31. Tree Adder Taxonomy, Cont’d ECE Department,](https://reader035.vdocuments.us/reader035/viewer/2022081402/6057e7faad4ec86cfa4e6393/html5/thumbnails/32.jpg)
Summary of Adders
Adder architectures offer area/power/delay tradeoffs
Choose the best one for your application
Architecture Classifi-cation
Logic lev-els
Max.fanout
Tra-cks
Cells
Ripple Carry N − 1 1 1 N
Carry-skip(n=4) N/4 + 5 2 1 1.25N
Carry-inc.(n=4) N/4 + 2 4 1 2N
Brent-Kung (L-1,0,0) 2log2N−1 2 1 2N
Sklansky (0,L-1,0) log2N N/2+1 1 0.5Nlog2N
Kogge-Stone (0,0,L-1) log2N 2 N/2 Nlog2N
ECE Department, University of Texas at Austin Lecture 8. Design of Adders Jacob Abraham, September 22, 2020 31 / 31