EE M216A.:. Fall Lecture 5. Logical Effort. Prof. Dejan Marković
|
|
- Rosamund Harmon
- 6 years ago
- Views:
Transcription
1 EE M26A.:. Fall 200 Lecture 5 Logical Effort Prof. Dejan Marković ee26a@gmail.com Logical Effort Recap Normalized delay d = g h + p g is the logical effort of the gate g = C IN /C INV Inverter is sized such that R INV equals the gate s drive strength h is the electrical effort h = C OUT /C IN The combination of g h is essentially our fan out definition p is the parasitic effort p = C SELF/ /C INV Typically ~ for an inverter May have different g, p for each type of gate structure The g, p may differ per input, and for pull up/down EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 2 2
2 A Side Note: Total Gate Effort (g TOT ) One way of evaluating a gate is to look at the total logical effort of the gate g TOT = C IN_TOT /C INV A sum of the total input capacitance Example: 3 input NAND Equivalent inverter is 4:2 g INPUT = 0/6=5/3 g TOT = 30/6 = 5 (or 3 g INPUT ) W P :W N = 4:6 The total gate effort is not very useful to calculate delay But it is an indication of the cost of the gate Can be very useful in gate mapping of logic synthesis To find which gate is best to use to map a given Boolean expression EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 3 3 A Note on Asymmetry The gates used in examples so far have been symmetric All inputs are essentially identical Some are bundled P:N ratio is approximately equal to the mobility ratio Same as the reference inverter The truth is that inputs of most gates are not symmetric Different inputs may see different capacitances Even series stacked gates may not be the same size Pull up and pull down is rarely equal resistance Call this skewed gates P:N sizing for optimal delay is β = root(µ) Inverter in a domino gate often favors the PMOS to improve speed EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 4 4
3 Asymmetric Examples PMOS NOR: different sizing Equivalent inv is still 6:2 C ina = 0, C inb = 26 g A (0/8=5/4) not equal to g B (26/8=3/4) B input is much worse (for a reason) For more complex gates: Equivalent inv is now 9:3 g EDC =2/2=7/4, g A B =30/2=5/2 e 9 d 9 c 9 a b 8 8 B A NOR Output Same β = µ = 3 e d c a b The larger g is BAD! (More effort to do logic) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 5 5 What is the Reference Inverter? The assumption of logical effort is that the reference inverter has equal rise and fall delays β =µ The implication for different pull up and pull down resistance is that the rising and falling delays are not equal Similar to the parasitic delay calculation earlier d UP = g UP h + p UP d DN = g DN h + p DN Since static CMOS gates are inverting, the transitions through subsequent gates must be alternating Use an average logical effort (and parasitic effort) a good idea g AVG = (g UP + g DN )/2 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 6 6
4 Skewed P:N Ratio Gates Assume: β =.7, µ = 3 Example: Inverter Pull up: reference inverter is sized P:N of W P :W P /µ g UP = W P (+/.7)/W/ P (+/µ) / = 9.9 Pull down: reference inverter is sized P:N of µw N :W N g DN = W N (+.7)/W N (+ µ) = g AVG = 0.93 (instead of ) Example: 2 input NAND Gate g UP = W P (+2/.7)/W P (+/µ) =.63 g DN = W N (2+.7)/W N (+ µ) ) = Average =.28 (instead of 5/4) Skewing rise/fall transition in gates may improve delay (because reference gate wasn t optimized for min t p ) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 7 7 Velocity Saturation Velocity saturation complicates a little Need to account for the change in resistance Assume reference inverter is W P =2W N Example: a 2 input NAND gate with sizing W P =2, W N =2 Assuming R N_nostack =(4/3)R N_stack, R P_nostack =(6/5)R P_stack The equivalent inverter with same drive resistance Pull up: equiv inv = 2:, g UP =4/3 (same as before) Pull down: equiv inv = 8/3:4/3, g DN =4/4= This makes sense because velocity saturation allows the transition through the series stacking be faster (more current) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 8 8
5 Choosing a Reference Inverter The reference inverter can actually be any β Logical effort can be used for optimally sizing a logic chain Part of optimal sizing is to add inverters to increase N (the number of logic stages) It is inconvenient to add inverters that do not have a LE of A common practice is to choose the reference inverter β to be the one that is used. Use a normalization to adjust the g. Calculate g INV(β =µ) assuming the reference inverter g AVG = Example: g REF =withβ β =7(µ.7 =3) g AVG_INV(β=µ) =.6 for β = 3 (µ = 3) A 2 input NAND β =.7 has g =.37 A 2 input NAND β = 3 has g =.45 =.25.6 g of 2 input NAND with reference inverter of β = µ is.25 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 9 9 Generalization for Multistage Networks Same concept applies at the path level Stage effort: f i = g i h i Path electrical effort: H path = C out /C in Path logical effort: G path = g g 2 g N Branching effort: B path = b b 2 b N Ignore this Path effort = G path H path B path for now Path delay D = Σd i = Σp i + Σg i h i EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 0 0
6 Total Effort A path can have a total effort G = Path Logical Effort G PATH = g i H = Path Electrical Effort F = Path Effort Consider path effort as fanout. Total fanout should be a product of all fanouts. Treat the path as a single gate H F PATH PATH = N i = C = C N i= OUT IN f i EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide Example: Total Effort Calculations G = (4/3) 2 (5/3) = 3 H = 60/4 = 5 F = 45; F?= GH (yes for this case) G H F PATH PATH PATH = N i= C = C = N i= g i OUT IN f i W P :W N =2:2 g=4/3 p =2 g=4/3 p=2 2 W P :W N =6:6 W P :W N =24:6 3 C out =60 g=5/3 p =2 f =4 f 2 = 3.33 f 3 = 3.33 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 2 2
7 Example: Random Multi stage Networks Delay of a multi stage network = sum of stage delays Path Effort Delay D F = f i Path Parasitic Delay P i = i p i Total Path Delay W P :W N =2:2 g = 4/3 p = 2 g = 4/3 p = 2 2 W P :W N = 6:6 D = di = DF + P i W P :W N = 24:6 3 g = 5/3 p = 2 C out = 60 f = 4 f 2 = f 3 = 3.33 D F = 0.66, P = 6 D = 6.66 (τ delays) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 3 3 Add Branching Effort Ratio of total to on path capacitance How much more current is needed to supply on path (given that some current flows off path) b = C on-path + C off-path C on-path c load EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 4 4
8 Branching Example # g = h = F = f = f 2 = F = 90/5 = 8 8 (wrong!) (5+5)/5 = 6 90/5 = 6 36, not 8! Introduce new kind of effort to account for branching: Branching Effort: Path Branching Effort: b = B = C on path + C off path Π b i C on path Now we can compute path effort: H = g h b EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 5 5 Multistage Networks with Branching General logical effort formulation Stage effort: f i = g i h i Path electrical effort: H path = C out /C in Path logical effort: G path = g g 2 g N Branching effort: B path = b b 2 b N Path effort = G path H path B path Branching Path delay D = Σd i = Σp i + Σg i b i h i EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 6 6
9 Branching Example #2 C in = 4 W P :W N = 6:6 W P :W N = 24:6 W P :W N = 2:2 g = 4/3 W P :W N = 24:6 p = 2 g = 4/3 p = 2 2 W P :W N = 6:6 3 g = 5/3 p = 2 C out = 60 branching w/o bran. f = 8 f 2 = 6.66 f = 4 f 2 = 3.33 f 3 = 3.33 f 3 = 3.33 For circuits with branching: G PATH is the same = 3 H PATH is the same = 5 F PATH differs h = 24/4= 6, h 2 = 60/2=5, h 3 =2 F PATH = 4/3 6 4/3 5 5/3 2 = 77.8 F is no longer GH New F PATH with branching: F PATH = G B H EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 7 7 Interconnects Capacitance from wires are the most difficult to deal with Fixed load so intuitively, we would increase fanout Short wires small parasitic capacitance Treat them as increasing p for each gate Not exact but accounts for the effect Long wires large capacitance (dominates gate loading) Size of driving gate is as if driving a large C (inverter chain) Size of receiving gate does not impact branching It is typically big and limited by area, power, and function Medium wires most difficult. Cap similar to gate loading Brute force is to write delay as function of gate and wire capacitances N th order polynomial and differentiate More realistic method is to iterate EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 8 8
10 Handling Wires & Fixed Loads i C L C w EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 9 9 Summary Delay and/or power of a logic network depend significantly on the relative sizes of logic gates (not transistors within a gate) Inverter buffering is a simple example of the analysis The analysis leads to ~FO4 as being optimal fanout for driving larger capacitive loads To generalize analysis of delay, we introduce logical effort Delay normalized by inverter delay, d = g h + p g and p are characteristics of a logic gate that depends on its structure and does not depend on gate size. May have different g s and p s for different inputs and PU / PD Simplify by using g AVG and ignoring C s of intermediate nodes Once a table of g s and p s are created for the catalog of gates, delay can be calculated quickly and easily Next we will look at how to size a network (instead of just analyzing it) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 20 20
11 Optimum Effort per Stage When each stage bears the same effort: Fanout of each stage: Complex gates should drive smaller load!!! Minimum path delay EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 2 2 Gate Sizing Example (/2) From: David Harris First, compute path effort: H path The optimal stage effort is: EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 22 22
12 Gate Sizing Example (2/2) We can now size the gates: 20 5 y z = = 3.8 x = = z x y = = 2.7 C in = = The total normalized delay is (assuming p inv = ): EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide Sizing Example with Branching Size the gates for optimum delay Once the path effort is determined, it is quite easy to determine the appropriate gate sizes Start from the output of a path Work backwards to the input C out _ ig C in _ i = f Check your work if the input is the same as the specification Assuming each unit W has capacitance of unit C opt i B = b b 2 =4 C in = 4 g = 4/3 p = 2 Gate 2 (dup) Gate 3 (dup) g = 4/3 p = g = 5/3 p = 2 C out = 60 F = 77.8, f opt = 5.62 C in3 = 60*5/3*/5.6 = 7.9 C in2 = b 2 *7.9*4/3*/5.6 = 8.5 C in = b *8.5*4/3*/5.6 = 4 W P3 = 4/5*7.9 = 4.3 W P2 = ½*8.5 = 4.25 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 24 24
13 Branches: Same # Stages, Different Loads Example: 2 paths with the same # of stages but different loads Optimal system has all paths with equal delay Branching for path, b = + α A ti i th t ~ Assumption is that p ~ p 2 C in Path C in2 C out C out2 D = D 2 N N F + p = N N F BGC out F = = F2 Cin Cin 2 B2G2C = α = C B G C in 2 out + p 2 B2G2C = C out 2 in 2 out 2 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide Path Effort Estimate With equal stage branches, the Path Effort can be estimated without knowing each stage s, b H tot = (C out +C out2 )/C in (with B = ) Simple example for Path : G = g NAND H = C out /C in B = (+C out2 /C out ) C in Since F = F 2 and G = G 2, B = (+C out2 /C out ) C in C in2 Path C out C out2 F = G H B = g NAND (C out +C out2 )/C in Same as F = G H tot The errors occur with different g and p for the gates in the two different paths EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 26 26
14 Unequal Length Branches (Not Straightforward) If both branches are long, then N =N 2 is an o.k. assumption Otherwise, f opt differs between two paths Solving precisely, example: C out = H CC in 2d inv p = C out /C C (d inv p) 2 in = C C out2 = C out2 /C 2 2 d nand 2 d d nand = g nand (C + C 2 )/C inv d inv in D = d nand + 2d inv = g nand (C out /(2d inv p) + C out2 /(d inv p) 2 ) + 2d inv Take partial derivative of D/ (d inv ) Not easy so ignore p to simplify If g NAND = 4/3, H = H 2 = 3: d nand = 2.35, d inv =.80 The per stage f = g h (no p) is different per stage Most branches are relatively long or not critical path C 2d inv = H 2 C in EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide Re convergent Paths Very similar to unequal branching, another logic structure that adds complexity to Logical Effort is recombined branches. Typically constrains the sizing problem Example: ignoring parasitics. Let x = C in = f a = (y+z)/x f b = (3z/y) f c = g NAND C out /z 2 variables C in x y f a f b f c 2x NANDz z C out Constrain with f a = f b = f c, 2 vars equations (directly solve) Any constraints are possible Increase variables by introducing more buffering (parallel to y) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 28 28
15 Logic Opt. Example: 2 Stage; 8 Input AND Assume symmetric 8 input AND (β = µ =2, 3W o is unit C) g NAND =0/3, p NAND =8 for an 8 input NAND g INV =, p INV = C out =00, C in = Logical effort G = 0/3, B =, H = 00 F = For 2 stages, f opt =8.3 h 2 = 8.3, C in2 = 5.5, W P = W o h = 5.5, C in =, W P = 0.6W o Delay = = 45.6 x8 G G 2 Buffering For 3 stages, f opt = 7 ( extra inverter), Delay = 3 For 4 stages, f opt = 4.3 (2 extra inverters), Delay = 28.2 For 5 stages, f opt = 3.9 (closer to optimal of 3.6), Delay=28 For 6 stages, f opt = 2.63 (below optimal of ~3.6), Delay=28.8 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide C out Logic Opt. Example: Multi 2 Input Gate 8 AND Many ways to implement this same function Use a tree of fewer input AND gates (A 0 A )(A 2 A 3 ) If multiple ANDs (as in a memory decoder), then partial results can be shared EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 30 30
16 2 input Implementation C in = G 2 G 3 C out = 00 Assuming that 3W o has capacitance of unit C F = B G H = 4/ = 235 f opt = 2.48 (too small) D = = = Still better than 8 input NAND Optimal sizing G 7 : C in7 = 00g inv /f = 40, W P =80W 0 G 6 : C in6 = C in7 g nand /f = 2.5, W P =32W 0 G 5 : C in5 = C in6 g inv /f = 8.7, W P = 7.4W 0 G 4 : C in4 = C in5 g nand /f = 4.7, W P = 7W 0 G 3 : C in3 = C in4 g inv /f =.88, W P = 3.8W 0 Double check G 2 : C in = C in3 g nand /f =, W P =.5W 0 G 4 G 5 G 6 G 7 out EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide input Implementation out C in = G 2 G 3 G 4 G 5 C out = 00 Assuming that unit for C = 3W o F = B G H = 4/3 6/3 00 = 266 f opt = 4.04 (a tad high) D = = 6.: = 24.6 Slightly worse than 2 input! Due to self loading Optimal sizing G 5 : C in5 = 00g inv /f = 24.75, W P =50W 0 G 4 : C in4 = C in5 g nand /f = 8.6, W P =2.5W 0 G 3 : C in3 = C in4 g inv /f = 2.02, W P =4W 0 Double check G 2 : C in =C in3 g nand4 /f =, W P =.0W 0 EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 32 32
17 Example: 2 NOR Implementation C in = G 2 C out = 00 Assuming that unit for C = 3W o F= BGH = 4/3 2 *5/3*00 = 296 f opt = 4.4 (a tad high) D = = = 23.6 (Best one!) Optimal sizing G 5: C in5 = 00g inv /f = 24., W P =48W 0 G 4 : C in4 = C in5 g nand /f = 7.76, W P =.6W 0 G 3 : C in3 = C in4 g nor /f = 3.25, W P =7.5W 0 Double check G 2 : C in = C in3 g nand /f =, W P =.5W 0 Lesson: use close to optimal f, use gates with small p G 3 G 4 G 5 out EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide Logical Effort Design Flow Compute the path effort: Path Effort = F = g h b Find the best number of stages: N* ~ log 4 (PathEffort) Compute the stage effort: se* = (PathEffort) /N Working from either end, determine gate sizes: Reference: Sutherland, Sproull, Harris, Logical Effort, (Morgan-Kaufmann 999) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 34 34
18 Summary of LE Design Methodology. Draw network 2. Buffer non critical paths with minimum sized gates Minimize loading on critical path Simplifies sizing of non critical path 3. Estimate total effort along each path (without branching) 4. Verify that the number of stages is appropriate Add inverters if f opt > 5 5. Assign branch ratio of each branch Estimate based on the ratio of the Effort of the paths Ignore paths that have little effect (i.e. min sized) Include wire capacitances 6. Compute delays for the design (include parasitic delay) Adjust branching ratios (especially with wire capacitance) Repeat if necessary until delay meets specification 7. Re optimize logic network if f opt is small (Return to step 3) EEM26A.:. Fall 200 Lecture 5: D. Logical Markovic Effort / Slide 35 35
EE M216A.:. Fall Lecture 4. Speed Optimization. Prof. Dejan Marković Speed Optimization via Gate Sizing
EE M216A.:. Fall 2010 Lecture 4 Speed Optimization Prof. Dejan Marković ee216a@gmail.com Speed Optimization via Gate Sizing Gate sizing basics P:N ratio Complex gates Velocity saturation ti Tapering Developing
More informationLogical Effort: Designing for Speed on the Back of an Envelope David Harris Harvey Mudd College Claremont, CA
Logical Effort: Designing for Speed on the Back of an Envelope David Harris David_Harris@hmc.edu Harvey Mudd College Claremont, CA Outline o Introduction o Delay in a Logic Gate o Multi-stage Logic Networks
More informationLogical Effort. Sizing Transistors for Speed. Estimating Delays
Logical Effort Sizing Transistors for Speed Estimating Delays Would be nice to have a back of the envelope method for sizing gates for speed Logical Effort Book by Sutherland, Sproull, Harris Chapter 1
More informationLogical Effort EE141
Logical Effort 1 Question #1 How to best combine logic and drive for a big capacitive load? C L C L 2 Question #2 All of these are decoders Which one is best? 3 Method to answer both of these questions
More informationECE429 Introduction to VLSI Design
ECE429 Introduction to VLSI Design Lecture 5: LOGICAL EFFORT Erdal Oruklu Illinois Institute of Technology Some of these slides have been adapted from the slides provided by David Harris, Harvey Mudd College
More informationEE 447 VLSI Design. Lecture 5: Logical Effort
EE 447 VLSI Design Lecture 5: Logical Effort Outline Introduction Delay in a Logic Gate Multistage Logic Networks Choosing the Best Number of Stages Example Summary EE 4475: VLSI Logical Design Effort
More informationLecture 5. Logical Effort Using LE on a Decoder
Lecture 5 Logical Effort Using LE on a Decoder Mark Horowitz Computer Systems Laboratory Stanford University horowitz@stanford.edu Copyright 00 by Mark Horowitz Overview Reading Harris, Logical Effort
More informationLecture 8: Combinational Circuit Design
Lecture 8: Combinational Circuit Design Mark McDermott Electrical and Computer Engineering The University of Texas at ustin 9/5/8 Verilog to Gates module mux(input s, d0, d, output y); assign y = s? d
More informationLecture 8: Logic Effort and Combinational Circuit Design
Lecture 8: Logic Effort and Combinational Circuit Design Slides courtesy of Deming Chen Slides based on the initial set from David Harris CMOS VLSI Design Outline q Logical Effort q Delay in a Logic Gate
More informationLecture 6: Logical Effort
Lecture 6: Logical Effort Outline Logical Effort Delay in a Logic Gate Multistage Logic Networks Choosing the Best Number of Stages Example Summary Introduction Chip designers face a bewildering array
More informationC.K. Ken Yang UCLA Courtesy of MAH EE 215B
Decoders: Logical Effort Applied C.K. Ken Yang UCLA yang@ee.ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 6.2.2 (Ratio-ed logic) W&H 6.2.2 Overview We have now gone through the basics of decoders,
More informationVLSI Design, Fall Logical Effort. Jacob Abraham
6. Logical Effort 6. Logical Effort Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 207 September 20, 207 ECE Department, University of
More informationVery Large Scale Integration (VLSI)
Very Large Scale Integration (VLSI) Lecture 4 Dr. Ahmed H. Madian Ah_madian@hotmail.com Dr. Ahmed H. Madian-VLSI Contents Delay estimation Simple RC model Penfield-Rubenstein Model Logical effort Delay
More informationLogic Gate Sizing. The method of logical effort. João Canas Ferreira. March University of Porto Faculty of Engineering
Logic Gate Sizing The method of logical effort João Canas Ferreira University of Porto Faculty of Engineering March 016 Topics 1 Modeling CMOS Gates Chain of logic gates João Canas Ferreira (FEUP) Logic
More information7. Combinational Circuits
7. Combinational Circuits Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 September 25, 2017 ECE Department, University of Texas
More informationIntroduction to CMOS VLSI Design. Lecture 5: Logical Effort. David Harris. Harvey Mudd College Spring Outline
Introduction to CMOS VLSI Design Lecture 5: Logical Effort David Harris Harve Mudd College Spring 00 Outline Introduction Dela in a Logic Gate Multistage Logic Networks Choosing the Best Number of Stages
More informationEE141. Administrative Stuff
-Spring 2004 Digital Integrated ircuits Lecture 15 Logical Effort Pass Transistor Logic 1 dministrative Stuff First (short) project to be launched next Th. Overall span: 1 week Hardware lab this week Hw
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Jan M. Rabaey nantha Chandrakasan orivoje Nikolić Designing Combinational Logic Circuits November 2002. 1 Combinational vs. Sequential Logic In Combinational
More informationInterconnect (2) Buffering Techniques. Logical Effort
Interconnect (2) Buffering Techniques. Logical Effort Lecture 14 18-322 Fall 2002 Textbook: [Sections 4.2.1, 8.2.3] A few announcements! M1 is almost over: The check-off is due today (by 9:30PM) Students
More informationLecture 8: Combinational Circuits
Introduction to CMOS VLSI Design Lecture 8: Combinational Circuits David Harris Harvey Mudd College Spring 004 Outline ubble Pushing Compound Gates Logical Effort Example Input Ordering symmetric Gates
More informationLecture 6: Circuit design part 1
Lecture 6: Circuit design part 6. Combinational circuit design 6. Sequential circuit design 6.3 Circuit simulation 6.4. Hardware description language Combinational Circuit Design. Combinational circuit
More informationLecture 8: Combinational Circuits
Introduction to CMOS VLSI Design Lecture 8: Combinational Circuits David Harris Harvey Mudd College Spring 00 Outline ubble Pushing Compound Gates Logical Effort Example Input Ordering symmetric Gates
More informationEE141-Fall 2011 Digital Integrated Circuits
EE4-Fall 20 Digital Integrated Circuits Lecture 5 Memory decoders Administrative Stuff Homework #6 due today Project posted Phase due next Friday Project done in pairs 2 Last Lecture Last lecture Logical
More informationStatic CMOS Circuits. Example 1
Static CMOS Circuits Conventional (ratio-less) static CMOS Covered so far Ratio-ed logic (depletion load, pseudo nmos) Pass transistor logic ECE 261 Krish Chakrabarty 1 Example 1 module mux(input s, d0,
More informationLecture 9: Combinational Circuits
Introduction to CMOS VLSI Design Lecture 9: Combinational Circuits David Harris, Harvey Mudd College Kartik Mohanram and Steven Levitan University of Pittsburgh Outline q ubble Pushing q Compound Gates
More informationAnnouncements. EE141-Spring 2007 Digital Integrated Circuits. CMOS SRAM Analysis (Read/Write) Class Material. Layout. Read Static Noise Margin
Vo l ta ge ri s e [ V] EE-Spring 7 Digital Integrated ircuits Lecture SRM Project Launch nnouncements No new labs next week and week after Use labs to work on project Homework #6 due Fr. pm Project updated
More informationLecture 9: Combinational Circuit Design
Lecture 9: Combinational Circuit Design Outline Bubble Pushing Compound Gates Logical Effort Example Input Ordering symmetric Gates Skewed Gates Best P/N ratio 0: Combinational Circuits CMOS VLSI Design
More informationDigital Microelectronic Circuits ( ) Logical Effort. Lecture 7: Presented by: Adam Teman
Digital Microelectronic ircuits (361-1-3021 ) Presented by: Adam Teman Lecture 7: Logical Effort Digital Microelectronic ircuits The VLSI Systems enter - BGU Lecture 7: Logical Effort 1 Last Lectures The
More informationEE141-Fall 2012 Digital Integrated Circuits. Announcements. Homework #3 due today. Homework #4 due next Thursday EECS141 EE141
EE4-Fall 0 Digital Integrated Circuits Lecture 7 Gate Delay and Logical Effort nnouncements Homework #3 due today Homework #4 due next Thursday Class Material Last lecture Inverter delay optimization Today
More informationAdvanced VLSI Design Prof. A. N. Chandorkar Department of Electrical Engineering Indian Institute of Technology- Bombay
Advanced VLSI Design Prof. A. N. Chandorkar Department of Electrical Engineering Indian Institute of Technology- Bombay Lecture - 04 Logical Effort-A Way of Designing Fast CMOS Circuits (Contd.) Last time,
More informationCARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING DIGITAL INTEGRATED CIRCUITS FALL 2002
CARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING 18-322 DIGITAL INTEGRATED CIRCUITS FALL 2002 Final Examination, Monday Dec. 16, 2002 NAME: SECTION: Time: 180 minutes Closed
More informationIntroduction to CMOS VLSI Design. Logical Effort B. Original Lecture by Jay Brockman. University of Notre Dame Fall 2008
Introduction to CMOS VLSI Design Logical Effort Part B Original Lecture b Ja Brockman Universit of Notre Dame Fall 2008 Modified b Peter Kogge Fall 2010,2011,2015, 2018 Based on lecture slides b David
More informationand V DS V GS V T (the saturation region) I DS = k 2 (V GS V T )2 (1+ V DS )
ECE 4420 Spring 2005 Page 1 FINAL EXAMINATION NAME SCORE /100 Problem 1O 2 3 4 5 6 7 Sum Points INSTRUCTIONS: This exam is closed book. You are permitted four sheets of notes (three of which are your sheets
More informationEECS 151/251A Homework 5
EECS 151/251A Homework 5 Due Monday, March 5 th, 2018 Problem 1: Timing The data-path shown below is used in a simple processor. clk rd1 rd2 0 wr regfile 1 0 ALU REG 1 The elements used in the design have
More informationEnergy Delay Optimization
EE M216A.:. Fall 21 Lecture 8 Energy Delay Optimization Prof. Dejan Marković ee216a@gmail.com Some Common Questions Is sizing better than V DD for energy reduction? What are the optimal values of gate
More informationEE241 - Spring 2000 Advanced Digital Integrated Circuits. Announcements
EE241 - Spring 2000 Advanced Digital Integrated Circuits Lecture 3 Circuit Optimization for Speed Announcements Tu 2/8/00 class will be pre-taped on Friday, 2/4, 4-5:30 203 McLaughlin Class notes are available
More informationSpiral 2 7. Capacitance, Delay and Sizing. Mark Redekopp
2-7.1 Spiral 2 7 Capacitance, Delay and Sizing Mark Redekopp 2-7.2 Learning Outcomes I understand the sources of capacitance in CMOS circuits I understand how delay scales with resistance, capacitance
More informationUsing MOS Models. C.K. Ken Yang UCLA Courtesy of MAH EE 215B
Using MOS Models C.K. Ken Yang UCLA yangck@ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 5.4 W&H 4.2 Background In the past two lectures we have reviewed the iv and CV curves for MOS devices, both
More informationLecture 12 CMOS Delay & Transient Response
EE 471: Transport Phenomena in Solid State Devices Spring 2018 Lecture 12 CMOS Delay & Transient Response Bryan Ackland Department of Electrical and Computer Engineering Stevens Institute of Technology
More informationIntegrated Circuits & Systems
Federal University of Santa Catarina Center for Technology Computer Science & Electronics Engineering Integrated Circuits & Systems INE 5442 Lecture 16 CMOS Combinational Circuits - 2 guntzel@inf.ufsc.br
More informationChapter 4. Digital Integrated Circuit Design I. ECE 425/525 Chapter 4. CMOS design can be realized meet requirements from
Digital Integrated Circuit Design I ECE 425/525 Professor R. Daasch Depar tment of Electrical and Computer Engineering Portland State University Portland, OR 97207-0751 (daasch@ece.pdx.edu) http://ece.pdx.edu/~ecex25
More informationLecture 14: Circuit Families
Introduction to CMOS VLSI Design Lecture 4: Circuit Families David Harris, Harvey Mudd College Kartik Mohanram and Steven Levitan University of Pittsburgh Outline q Pseudo-nMOS Logic q Dynamic Logic q
More informationEE115C Digital Electronic Circuits Homework #5
EE115C Digital Electronic Circuits Homework #5 Due Thursday, May 13, 6pm @ 56-147E EIV Problem 1 Elmore Delay Analysis Calculate the Elmore delay from node A to node B using the values for the resistors
More informationEE115C Digital Electronic Circuits Homework #6
Problem 1 Sizing of adder blocks Electrical Engineering Department Spring 2010 EE115C Digital Electronic Circuits Homework #6 Solution Figure 1: Mirror adder. Study the mirror adder cell (textbook, pages
More informationChapter 2 DESIGN OF ENERGY EFFICIENT DIGITAL CIRCUITS
Chapter 2 DESIGN OF ENERGY EFFICIENT DIGITAL CIRCUITS Bart R. Zeydel and Vojin G. Oklobdzija ACSEL Laboratory, University of California, Davis Abstract: Key words: Recent technology advances have resulted
More informationLecture Outline. ESE 570: Digital Integrated Circuits and VLSI Fundamentals. Review: 1st Order RC Delay Models. Review: Two-Input NOR Gate (NOR2)
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 14: March 1, 2016 Combination Logic: Ratioed and Pass Logic Lecture Outline! CMOS Gates Review " CMOS Worst Case Analysis! Ratioed Logic Gates!
More informationCMOS Transistors, Gates, and Wires
CMOS Transistors, Gates, and Wires Should the hardware abstraction layers make today s lecture irrelevant? pplication R P C W / R W C W / 6.375 Complex Digital Systems Christopher atten February 5, 006
More informationEE 466/586 VLSI Design. Partha Pande School of EECS Washington State University
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University pande@eecs.wsu.edu Lecture 9 Propagation delay Power and delay Tradeoffs Follow board notes Propagation Delay Switching Time
More informationIntegrated Circuits & Systems
Federal University of Santa Catarina Center for Technology Computer Science & Electronics Engineering Integrated Circuits & Systems INE 5442 Lecture 14 The CMOS Inverter: dynamic behavior (sizing, inverter
More informationLecture 6: DC & Transient Response
Lecture 6: DC & Transient Response Slides courtesy of Deming Chen Slides based on the initial set from David Harris CMOS VLSI Design Outline Pass Transistors DC Response Logic Levels and Noise Margins
More informationLecture 34: Portable Systems Technology Background Professor Randy H. Katz Computer Science 252 Fall 1995
Lecture 34: Portable Systems Technology Background Professor Randy H. Katz Computer Science 252 Fall 1995 RHK.F95 1 Technology Trends: Microprocessor Capacity 100000000 10000000 Pentium Transistors 1000000
More informationLecture 4. Adders. Computer Systems Laboratory Stanford University
Lecture 4 Adders Computer Systems Laboratory Stanford University horowitz@stanford.edu Copyright 2006 Mark Horowitz Some figures from High-Performance Microprocessor Design IEEE 1 Overview Readings Today
More informationEE141-Fall Digital Integrated Circuits. Announcements. Lab #2 Mon., Lab #3 Fri. Homework #3 due Thursday. Homework #4 due next Thursday
EE4-Fall 2000 Digital Integrated ircuits Lecture 6 Inverter Delay Optimization Announcements Lab #2 Mon., Lab #3 Fri. Homework #3 due Thursday Homework #4 due next Thursday 2 2 lass Material Last lecture
More informationHomework #2 10/6/2016. C int = C g, where 1 t p = t p0 (1 + C ext / C g ) = t p0 (1 + f/ ) f = C ext /C g is the effective fanout
0/6/06 Homework # Lecture 8, 9: Sizing and Layout of omplex MOS Gates Reading: hapter 4, sections 4.3-4.5 October 3 & 5, 06 hapter, section.5.5 Prof. R. Iris ahar Weste & Harris vailable on course webpage
More information5.0 CMOS Inverter. W.Kucewicz VLSICirciuit Design 1
5.0 CMOS Inverter W.Kucewicz VLSICirciuit Design 1 Properties Switching Threshold Dynamic Behaviour Capacitance Propagation Delay nmos/pmos Ratio Power Consumption Contents W.Kucewicz VLSICirciuit Design
More informationEEC 118 Lecture #6: CMOS Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation
EEC 118 Lecture #6: CMOS Logic Rajeevan mirtharajah University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW 3 due this
More informationEEC 116 Lecture #5: CMOS Logic. Rajeevan Amirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation
EEC 116 Lecture #5: CMOS Logic Rajeevan mirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW
More informationThe CMOS Inverter: A First Glance
The CMOS Inverter: A First Glance V DD S D V in V out C L D S CMOS Inverter N Well V DD V DD PMOS 2λ PMOS Contacts In Out In Out Metal 1 NMOS Polysilicon NMOS GND CMOS Inverter: Steady State Response V
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts
More informationDigital Microelectronic Circuits ( )
Digital Microelectronic ircuits (361-1-3021 ) Presented by: Dr. Alex Fish Lecture 5: Parasitic apacitance and Driving a Load 1 Motivation Thus far, we have learned how to model our essential building block,
More informationEE213, Spr 2017 HW#3 Due: May 17 th, in class. Figure 1
RULES: Please try to work on your own. Discussion is permissible, but identical submissions are unacceptable! Please show all intermediate steps: a correct solution without an explanation will get zero
More informationLecture 1: Gate Delay Models
High Speed CMOS VLSI Design Lecture 1: Gate Delay Models (c) 1997 David Harris 1.0 Designing for Speed on the Back of an Envelope Custom IC design is all about speed. For a small amount of money, one synthesize
More informationCircuit A. Circuit B
UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences Last modified on November 19, 2006 by Karl Skucha (kskucha@eecs) Borivoje Nikolić Homework #9
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences Analysis and Design of Digital Integrated Circuits (6.374) - Fall 2003 Quiz #2 Prof. Anantha Chandrakasan
More informationLecture 6: Time-Dependent Behaviour of Digital Circuits
Lecture 6: Time-Dependent Behaviour of Digital Circuits Two rather different quasi-physical models of an inverter gate were discussed in the previous lecture. The first one was a simple delay model. This
More informationTestability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.
Testability Lecture 6: Logic Simulation Shaahin Hessabi Department of Computer Engineering Sharif University of Technology Adapted from the presentation prepared by book authors Slide 1 of 27 Outline What
More informationECE 342 Electronic Circuits. Lecture 34 CMOS Logic
ECE 34 Electronic Circuits Lecture 34 CMOS Logic Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu 1 De Morgan s Law Digital Logic - Generalization ABC... ABC...
More informationLecture 4: DC & Transient Response
Introduction to CMOS VLSI Design Lecture 4: DC & Transient Response David Harris Harvey Mudd College Spring 004 Outline DC Response Logic Levels and Noise Margins Transient Response Delay Estimation Slide
More informationENEE 359a Digital VLSI Design
SLIDE 1 ENEE 359a Digital VLSI Design & Logical Effort Prof. blj@ece.umd.edu Credit where credit is due: Slides contain original artwork ( Jacob 2004) as well as material taken liberally from Irwin & Vijay
More informationVLSI GATE LEVEL DESIGN UNIT - III P.VIDYA SAGAR ( ASSOCIATE PROFESSOR) Department of Electronics and Communication Engineering, VBIT
VLSI UNIT - III GATE LEVEL DESIGN P.VIDYA SAGAR ( ASSOCIATE PROFESSOR) contents GATE LEVEL DESIGN : Logic Gates and Other complex gates, Switch logic, Alternate gate circuits, Time Delays, Driving large
More informationEE141Microelettronica. CMOS Logic
Microelettronica CMOS Logic CMOS logic Power consumption in CMOS logic gates Where Does Power Go in CMOS? Dynamic Power Consumption Charging and Discharging Capacitors Short Circuit Currents Short Circuit
More informationESE 570: Digital Integrated Circuits and VLSI Fundamentals
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 15: March 3, 2016 Combination Logic: Ratioed & Pass Logic, and Performance Lecture Outline! CMOS NOR2 Worst Case Analysis! Pass Transistor
More informationLecture 5 Fault Modeling
Lecture 5 Fault Modeling Why model faults? Some real defects in VLSI and PCB Common fault models Stuck-at faults Single stuck-at faults Fault equivalence Fault dominance and checkpoint theorem Classes
More informationCPE/EE 427, CPE 527 VLSI Design I L18: Circuit Families. Outline
CPE/EE 47, CPE 57 VLI Design I L8: Circuit Families Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) www.ece.uah.edu/~milenka/cpe57-05f
More informationCHAPTER 15 CMOS DIGITAL LOGIC CIRCUITS
CHAPTER 5 CMOS DIGITAL LOGIC CIRCUITS Chapter Outline 5. CMOS Logic Gate Circuits 5. Digital Logic Inverters 5.3 The CMOS Inverter 5.4 Dynamic Operation of the CMOS Inverter 5.5 Transistor Sizing 5.6 Power
More informationLecture 5: DC & Transient Response
Lecture 5: DC & Transient Response Outline q Pass Transistors q DC Response q Logic Levels and Noise Margins q Transient Response q RC Delay Models q Delay Estimation 2 Activity 1) If the width of a transistor
More informationCOMP 103. Lecture 10. Inverter Dynamics: The Quest for Performance. Section 5.4.2, What is this lecture+ about? PERFORMANCE
COMP 103 Lecture 10 Inverter Dynamics: The Quest for Performance Section 5.4.2, 5.4.3 [All lecture notes are adapted from Mary Jane Irwin, Penn State, which were adapted from Rabaey s Digital Integrated
More informationUniversity of Toronto. Final Exam
University of Toronto Final Exam Date - Apr 18, 011 Duration:.5 hrs ECE334 Digital Electronics Lecturer - D. Johns ANSWER QUESTIONS ON THESE SHEETS USING BACKS IF NECESSARY 1. Equation sheet is on last
More informationLogic Effort Revisited
Logic Effort Revisited Mark This note ill take another look at logical effort, first revieing the asic idea ehind logical effort, and then looking at some of the more sutle issues in sizing transistors..0
More informationDigital EE141 Integrated Circuits 2nd Combinational Circuits
Digital Integrated Circuits Designing i Combinational Logic Circuits 1 Combinational vs. Sequential Logic 2 Static CMOS Circuit t every point in time (except during the switching transients) each gate
More informationESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals
University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals ESE570, Spring 017 Final Wednesday, May 3 4 Problems with point weightings shown.
More informationInterconnect (2) Buffering Techniques.Transmission Lines. Lecture Fall 2003
Interconnect (2) Buffering Techniques.Transmission Lines Lecture 12 18-322 Fall 2003 A few announcements Partners Lab Due Times Midterm 1 is nearly here Date: 10/14/02, time: 3:00-4:20PM, place: in class
More informationManaging Physical Design Issues in ASIC Toolflows Complex Digital Systems Christopher Batten February 21, 2006
Managing Physical Design Issues in ASI Toolflows 6.375 omplex Digital Systems hristopher Batten February 1, 006 Managing Physical Design Issues in ASI Toolflows Logical Effort Physical Design Issues lock
More informationAnnouncements. EE141- Spring 2003 Lecture 8. Power Inverter Chain
- Spring 2003 Lecture 8 Power Inverter Chain Announcements Homework 3 due today. Homework 4 will be posted later today. Special office hours from :30-3pm at BWRC (in lieu of Tuesday) Today s lecture Power
More informationEE5780 Advanced VLSI CAD
EE5780 Advanced VLSI CAD Lecture 4 DC and Transient Responses, Circuit Delays Zhuo Feng 4.1 Outline Pass Transistors DC Response Logic Levels and Noise Margins Transient Response RC Delay Models Delay
More informationUNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences. Professor Oldham Fall 1999
UNIVERSITY OF CLIFORNI College of Engineering Department of Electrical Engineering and Computer Sciences Professor Oldham Fall 1999 EECS 40 FINL EXM 13 December 1999 Name: Last, First Student ID: T: Kusuma
More informationDigital Integrated Circuits Designing Combinational Logic Circuits. Fuyuzhuo
Digital Integrated Circuits Designing Combinational Logic Circuits Fuyuzhuo Introduction Digital IC Dynamic Logic Introduction Digital IC EE141 2 Dynamic logic outline Dynamic logic principle Dynamic logic
More informationECE 546 Lecture 10 MOS Transistors
ECE 546 Lecture 10 MOS Transistors Spring 2018 Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu NMOS Transistor NMOS Transistor N-Channel MOSFET Built on p-type
More informationPhysical Design of Digital Integrated Circuits (EN0291 S40) Sherief Reda Division of Engineering, Brown University Fall 2006
Physical Design of Digital Integrated Circuits (EN0291 S40) Sherief Reda Division of Engineering, Brown University Fall 2006 1 Lecture 04: Timing Analysis Static timing analysis STA for sequential circuits
More informationDynamic operation 20
Dynamic operation 20 A simple model for the propagation delay Symmetric inverter (rise and fall delays are identical) otal capacitance is linear t p Minimum length devices R W C L t = 0.69R C = p W L 0.69
More informationDigital Integrated Circuits 2nd Inverter
Digital Integrated Circuits The Inverter The CMOS Inverter V DD Analysis Inverter complex gate Cost V in V out complexity & Area Integrity and robustness C L Static behavior Performance Dynamic response
More informationEE241 - Spring 2000 Advanced Digital Integrated Circuits. Announcements
EE241 - Spring 2 Advanced Digital Integrated Circuits Lecture 11 Low Power-Low Energy Circuit Design Announcements Homework #2 due Friday, 3/3 by 5pm Midterm project reports due in two weeks - 3/7 by 5pm
More informationDigital Integrated Circuits A Design Perspective
Semiconductor Memories Adapted from Chapter 12 of Digital Integrated Circuits A Design Perspective Jan M. Rabaey et al. Copyright 2003 Prentice Hall/Pearson Outline Memory Classification Memory Architectures
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits Design Perspective Designing Combinational Logic Circuits Fuyuzhuo School of Microelectronics,SJTU Introduction Digital IC Dynamic Logic Introduction Digital IC 2 EE141 Dynamic
More informationLogical Effort Based Design Exploration of 64-bit Adders Using a Mixed Dynamic-CMOS/Threshold-Logic Approach
Logical ffort Based Design xploration of 64-bit Adders Using a Mixed Dynamic-CMOS/Threshold-Logic Approach Peter Celinski, Said Al-Sarawi, Derek Abbott Centre for High Performance Integrated Technologies
More informationEE 330 Lecture 39. Digital Circuits. Propagation Delay basic characterization Device Sizing (Inverter and multiple-input gates)
EE 330 Lecture 39 Digital ircuits Propagation Delay basic characterization Device Sizing (Inverter and multiple-input gates) Review from last lecture Other MOS Logic Families Enhancement Load NMOS Enhancement
More informationEECS 151/251A Spring 2018 Digital Design and Integrated Circuits. Instructors: Nick Weaver & John Wawrzynek. Lecture 12 EE141
EECS 151/251A Spring 2018 Digital Design and Integrated Circuits Instructors: Nick Weaver & John Wawrzynek Lecture 12 1 Wire Models All-inclusive model Capacitance-only 2 Capacitance Capacitance: The Parallel
More informationUNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences
UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences Elad Alon Homework #9 EECS141 PROBLEM 1: TIMING Consider the simple state machine shown
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall Timing Analysis & Optimization Reading: Logic Synthesis in a Nutshell Sections
More informationChapter 5 CMOS Logic Gate Design
Chapter 5 CMOS Logic Gate Design Section 5. -To achieve correct operation of integrated logic gates, we need to satisfy 1. Functional specification. Temporal (timing) constraint. (1) In CMOS, incorrect
More information