Logical Effort: Designing for Speed on the Back of an Envelope David Harris Harvey Mudd College Claremont, CA


 Nathaniel Goodwin
 3 years ago
 Views:
Transcription
1 Logical Effort: Designing for Speed on the Back of an Envelope David Harris Harvey Mudd College Claremont, CA
2 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 2 of 56
3 Introduction Chip designers face a bewildering array of choices. o What is the best circuit topology for a function? o How large should the transistors be? o How many stages of logic give least delay???? Logical Effort is a method of answering these questions: o Uses a very simple model of delay o Back of the envelope calculations and tractable optimization o Gives new names to old ideas to emphasize remarkable symmetries Who cares about logical effort? o Circuit designers waste too much time simulating and tweaking circuits o High speed logic designers need to know where time is going in their logic o CAD engineers need to understand circuits to build better tools Logical Effort David Harris Page 3 of 56
4 Example Ben Bitdiddle is the memory designer for the Motoroil 68W86, an embedded processor for automotive applications. Help Ben design the decoder for a register file: a<3:0> a<3:0> 32 bits Decoder specification: o 16 word register file o Each word is 32 bits wide 16 Register File o Each bit presents a load of 3 unitsized transistors o True and complementary inputs of address bits a<3:0> are available o Each input may drive 10 unitsized transistors 4:16 Decoder 16 words Ben needs to decide: o How many stages to use? o How large should each gate be? o How fast can the decoder operate? Logical Effort David Harris Page 4 of 56
5 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 5 of 56
6 Delay in a Logic Gate Let us express delays in a processindependent unit: Delay of logic gate has two components: d d abs τ τ 12 ps in 0.18 µm technology d f + p Effort delay again has two components: effort delay, a.k.a. stage effort parasitic delay f gh logical effort electrical effort C out /C in electrical effort is sometimes called fanout o Logical effort describes relative ability of gate topology to deliver current (defined to be 1 for an inverter) o Electrical effort is the ratio of output to input capacitance Logical Effort David Harris Page 6 of 56
7 Delay Plots Normalized delay: d input NAND inverter g p d effort delay g p d parasitic delay How about a 2input NOR? Electrical effort: h C out / C in o d f + p gh + p o Delay increases with electrical effort o More complex gates have greater logical effort and parasitic delay Logical Effort David Harris Page 7 of 56
8 Computing Logical Effort DEF: Logical effort is the ratio of the input capacitance of a gate to the input capacitance of an inverter delivering the same output current. o Measured from delay vs. fanout plots of simulated or measured gates o Or estimated, counting capacitance in units of transistor width: a Inverter: C in 3 g 1 (def) 2 1 x a b NAND2: C in 4 g 4/3 x a b NOR2: C in 5 g 5/3 1 x Logical Effort David Harris Page 8 of 56
9 A Catalog of Gates Table 1: Logical effort of static CMOS gates Gate type Number of inputs n inverter 1 NAND 4/3 5/3 6/3 7/3 (n+2)/3 NOR 5/3 7/3 9/3 11/3 (2n+1)/3 multiplexer XOR, XNOR Table 2: Parasitic delay of static CMOS gates Gate type inverter ninput NAND ninput NOR nway multiplexer 2input XOR, XNOR Parasitic delay p inv np inv np inv 2np inv 4np inv p inv 1 parasitic delays depend on diffusion capacitance Logical Effort David Harris Page 9 of 56
10 Example Estimate the frequency of an Nstage ring oscillator: Logical Effort: Electrical Effort: Parasitic Delay: Stage Delay: Oscillator Frequency: g h p d F Logical Effort David Harris Page 10 of 56
11 Example Estimate the delay of a fanoutof4 (FO4) inverter: d Logical Effort: Electrical Effort: Parasitic Delay: Stage Delay: g h p d Logical Effort David Harris Page 11 of 56
12 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 12 of 56
13 Multistage Logic Networks Logical effort extends to multistage networks: 10 x y z 20 g 1 1 h 1 x/10 g 2 5/3 h 2 y/x g 3 4/3 h 3 z/y g 4 1 h 4 20/z o Path Logical Effort: o Path Electrical Effort: o Path Effort: G H F g i C out (path) C in (path) f i g i h i Don t define H h i because we don t know h i until the design is done Can we write F GH? Logical Effort David Harris Page 13 of 56
14 Branching Effort No! Consider circuits that branch: G H GH h 1 h 2 F GH? Logical Effort David Harris Page 14 of 56
15 Delay in Multistage Networks We can now compute the delay of a multistage network: o Path Effort Delay: D F f i o Path Parasitic Delay: P F p i o Path Delay: D F d i D F + P We can prove that delay is minimized when each stage bears the same effort: Therefore, the minimum delay of an Nstage path is: ˆ f g i h i NF 1 N + P F 1 N o This is a key result of logical effort. Lowest possible path delay can be found without even calculating the sizes of each gate in the path. Logical Effort David Harris Page 15 of 56
16 Determining Gate Sizes Gate sizes can be found by starting at the end of the path and working backward. o At each gate, apply the capacitance transformation: C outi g i C ini ˆ f o Check your work by verifying that the input capacitance specification is satisfied at the beginning of the path. Logical Effort David Harris Page 16 of 56
17 Example Select gate sizes y and z to minimize delay from A to B Logical Effort: Electrical Effort: G H A C y y z z z 9C 9C B 9C Branching Effort: B Path Effort: F Best Stage Effort: Delay: ˆ f D Work backward for sizes: z y Logical Effort David Harris Page 17 of 56
18 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 18 of 56
19 Choosing the Best Number of Stages How many stages should a path use? o Delay is not always minimized by using as few stages as possible o Example: How to drive 64 bit datapath with unitsized inverter Initial driver Datapath load N: f: D: Fastest D NF 1 N + P N64 ( ) 1 N + N assuming polarity doesn t matter Logical Effort David Harris Page 19 of 56
20 Derivation of the Best Number of Stages Suppose we can add inverters to the end of a path without changing its function. o How many stages should we use? Let Nˆ be the value of N for least delay. Logic Block: n 1 stages Path effort F Nn 1 extra inverters F 1 Nˆ NF 1 N p i D + + ( N n 1 )p inv o Define ρ to be the best stage effort. Substitute and simplify: n 1 1 D F 1 N ln( F 1 N ) + F 1 N + p N inv 0 p inv + ρ( 1 lnρ) 0 Logical Effort David Harris Page 20 of 56
21 Best Number of Stages (continued) p inv + ρ( 1 lnρ) 0 has no closed form solution. o Neglecting parasitics (i.e. p inv 0), we get the familiar result that ρ (e) o For p inv 1, we can solve numerically to obtain ρ 3.59 How sensitive is the delay to using exactly the best number of stages? D(N) / D(N) (ρ2.4) (ρ6) I like to use ρ N / N o 2.4 < ρ < 6 gives delays within 15% of optimal > we can be sloppy Logical Effort David Harris Page 21 of 56
22 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 22 of 56
23 Example Let s revisit Ben Bitdiddle s decoder problem using logical effort: a<3:0> a<3:0> 32 bits Decoder specification: Register File o 16 word register file 16 o Each word is 32 bits wide o Each bit presents a load of 3 unitsized transistors o True and complementary inputs of address bits a<3:0> are available o Each input may drive 10 unitsized transistors 4:16 Decoder 16 words Ben needs to decide: o How many stages to use? o How large should each gate be? o How fast can the decoder operate? Logical Effort David Harris Page 23 of 56
24 Example: Number of Stages How many stages should Ben use? o Effort of decoders is dominated by electrical and branching portions H B o Electrical Effort: o Branching Effort: If we neglect logical effort (assume G 1), o Path Effort: F Remember that the best stage effort is about ρ 4 o Hence, the best number of stages is: N Logical Effort David Harris Page 24 of 56
25 Example: Gate Sizes & Delay G Lets try a 3stage design using 16 4input NAND gates with a 0 a 0 a 1 a 1 a 2 a 2 a 3 a 3 10 unit input capacitance y z out 0 96 unit wordline capacitance y z out 15 o Actual path effort is: o Therefore, stage effort should be: o Gate sizes: o Path delay: F f z y D Logical Effort David Harris Page 25 of 56
26 Example: Alternative Decoders Table 3: Comparison of Decoder Designs Design Stages G P D NAND4; INV INV; NAND4; INV INV; NAND4; INV; INV NAND2; INV; NAND2; INV 4 16/ INV; NAND2; INV; NAND2; INV 5 16/ NAND2; INV; NAND2; INV; INV; INV 6 16/ INV; NAND2; INV; NAND2; INV; INV; INV 7 16/ NAND2; INV; NAND2; INV; INV; INV; INV; INV 8 16/ We underestimated the best number of stages by neglecting the logical effort. o Logical effort facilitates comparing different designs before selecting sizes o Using more stages also reduces G and P by using multiple 2input gates o Our design was about 10% slower than the best Logical Effort David Harris Page 26 of 56
27 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 27 of 56
28 Asymmetric Gates Asymmetric logic gates favor one input over another. Example: suppose input A of a NAND gate is most critical. o Select sizes so pullup and pulldown still match unit inverter o Place critical input closest to output a 2 2 4/3 4 x b o Logical Effort on input A: o Logical Effort on input B: o Total Logical Effort: g A g B g tot g A + g B Logical Effort David Harris Page 28 of 56
29 Symmetry Factor In general, consider gates with arbitrary symmetry factor s: o s 1/2 in symmetric gate with equal sizes o s 1/4 in previous example a 2 2 1/(1s) x Logical effort of inputs: s s s1 ( s) 4 g A g 3 B g 3 tot o Critical input approaches logical effort of inverter 1 for small s o But total logical effort is higher for asymmetric gates 1/s b Logical Effort David Harris Page 29 of 56
30 Skewed Gates Skewed gates favor one edge over the other. Example: suppose rising output of inverter is most critical. o Downsize noncritical NMOS transistor to reduce total input capacitance a 2 1/2 x a 2 1 x a 1 1/2 x HISkewed inverter Unskewed w/ Unskewed w/ equal rise equal fall Compare with unskewed inverter of the same rise/fall time to compute effort. o Logical Effort for rising (up) output: o Logical Effort for falling (down) output: o Average Logical Effort: g u g d g avg ( g u + g d ) 2 Logical Effort David Harris Page 30 of 56
31 HI and LOSkewed Gates DEF: Logical effort of a skewed gate for a particular transition is the ratio of the input capacitance of that gate to the input capacitance of an unskewed inverter delivering the same output current for the same transition. Skew gates by reducing size of noncritical transistors. o HISkewed gates favor rising outputs by downsizing NMOS transistors o LOSkewed gates favor falling outputs by downsizing PMOS transistors o Logical effort is smaller for the favored input due to lower input capacitance o Logical effort is larger for the other input Logical Effort David Harris Page 31 of 56
32 Catalog of Skewed Gates Inverter NAND2 NOR2 HISkew 2 ½ g u 5/6 g d 5/3 g 5/4 avg g u 1 g d 2 g 3/2 avg 4 4 ½ g u 3/2 g d 3 g 9/4 avg ½ LOSkew 1 1 g u 4/3 g d 2/3 g 1 avg g u 2 g d 1 g 3/2 avg g u 2 g d 1 g 3/2 avg 1 Logical Effort David Harris Page 32 of 56
33 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 33 of 56
34 PseudoNMOS PseudoNMOS gates replace fat PMOS pullups on inputs with a resistive pullup. o Resistive pullup must be much weaker than pulldown stack (e.g. 4x) o Reduces logical effort because inputs must only drive the NMOS transistors o However, NMOS current reduced by contention with pullup o Unequal rising and falling efforts o Quiescent power dissipation when output is low Example: PseudoNMOS inverter o Logical Effort for falling (down) output: o Logical Effort for rising (up) output: o Average Logical Effort: g d a g u g avg ( g u + g d ) 2 2/3 4/3 x Logical Effort David Harris Page 34 of 56
35 PseudoNMOS Gates Inverter NAND2 NOR2 a 2/3 4/3 x a 2/3 8/3 x a 2/3 4/3 b 4/3 x b 8/3 g d 4/9 g u 4/3 g avg 8/9 g d 8/9 g u 8/3 g avg 16/9 g d 4/9 g u 4/3 g avg 8/9 Tradeoffs exist between power and effort by varying P/N ratio. Logical Effort David Harris Page 35 of 56
36 Dynamic Logic Dynamic logic replace fat PMOS pullups on inputs with a clocked precharge. o Reduces logical effort because inputs must only drive the NMOS transistors o Eliminates pseudonmos contention current and power dissipation o Only the falling ( evaluation ) delay is critical o Downsize noncritical precharge transistors to reduce clock load and power Example: Footless dynamic inverter o Logical Effort for falling (down) output: g d φ a 1 1 x Robust gates may require keepers and clocked pulldown transistors ( feet ). o Feet prevent contention during precharge but increase logical effort o Weak keepers prevent floating output at cost of slight contention during eval Logical Effort David Harris Page 36 of 56
37 Dynamic Gates Inverter NAND2 NOR2 Footless φ 1 φ 1 φ 1 x x x a 1 a 2 a 1 1 b g d 1/3 b 2 g d 2/3 g d 1/3 Footed φ 1 φ 1 φ 1 x x x a 2 a 3 a 2 2 b g d 2/3 b 3 g d 1 g d 2/3 φ 2 φ 2 φ 3 Logical Effort David Harris Page 37 of 56
38 Domino Gates Dynamic gates require monotonically rising inputs. o However, they generate monotonically falling outputs o Alternate dynamic gates with HIskew inverting static gates o Dynamic / static pair is called a domino gate Example: Domino Buffer o Constraints: maximum input capacitance 3, load 54 o Logical Effort: G o Branching Effort: B o Electrical Effort: H φ 3 o Path Effort: F a o Stage Effort: f 3 o HISkew Inverter: size o Transistor Sizes: n p p n g 1 g 2 HISkew 54 Logical Effort David Harris Page 38 of 56
39 Comparison of Circuit Families Assumptions: o PMOS transistors have half the drive of NMOS transistors o Skewed gates downsize noncritical transistors by factor of two o PseudoNMOS gates have 1/4 strength pullups Table 4: Summary of Logical Efforts Circuit Style Inverter g ninput NAND g ninput NOR g g u g d g u g d g u g d Static CMOS 1 (n+2)/3 (2n+1)/3 HISkew 5/6 5/3 (n/2+2)/3 (n+4)/3 (2n+.5)/3 (4n+1)/3 LOSkew 4/3 2/3 2(n+1)/3 (n+1)/3 2(n+1)/3 (n+1)/3 PseudoNMOS 4/3 4/9 4n/3 4n/9 4/3 4/9 Footed Dynamic 2/3 (n+1)/3 2/3 Footless Dynamic 1/3 n/3 1/3 Adjust these numbers as you change your assumptions. Logical Effort David Harris Page 39 of 56
40 Outline o Introduction o Delay in a Logic Gate o Multistage Logic Networks o Choosing the Best Number of Stages o Example o Asymmetric & Skewed Logic Gates o Circuit Families o Summary Logical Effort David Harris Page 40 of 56
41 Summary Table 5: Key Definitions of Logical Effort Term Stage expression Path expression Logical effort (seetable 1) Electrical effort Branching effort Effort Effort delay Number of stages Parasitic delay Delay g G g i n/a C out h H C in B C out (path) C in (path) b i f gh F GBH f D F 1 N f i p (seetable 2) P p i d f + p D D F + P Logical Effort David Harris Page 41 of 56
42 Method of Logical Effort Logical effort helps you find the best number of stages, the best size of each gate, and the minimum delay of a circuit with the following procedure: o Compute the path effort: o Estimate the best number of stages: F GBH Nˆ log 4 F o Estimate the minimum delay: o Sketch your path using the number of stages computed above o Compute the stage effort: o Starting at the end, work backward to find transistor sizes: C outi g i C ini ˆ D ˆ f Nˆ F 1 Nˆ F 1 N f + P Logical Effort David Harris Page 42 of 56
43 Limitations of Logical Effort Logical effort is not a panacea. Some limitations include: o Chicken & egg problem how to estimate G and best number of stages before the path is designed o Simplistic delay model neglects effects of input slopes o Interconnect iteration required in designs with branching and nonnegligible wire C or RC same convergence difficulties as in synthesis / placement problem o Maximum speed only optimizes circuits for speed, not area or power under a fixed speed constraint Logical Effort David Harris Page 43 of 56
44 Conclusion Logical effort is a useful concept for thinking about delay in circuits: o Facilitates comparison of different circuit topologies o Easily select gate sizes for minimum delay o Circuits are fastest when effort delays of each stage are equal and about 4 o Path delay is insensitive to modest deviations from optimal sizes o Logic gates can be skewed to favor one input or edge at the cost of another o Logical effort can be applied to domino, pseudonmos, and other logic families Logical effort provides a language for engineers to discuss why circuits are fast. o Like any language, requires practice to master A book on Logical Effort is available from Morgan Kaufmann Publishers o o Discusses P/N ratios, gate characterization, pass gate logic, forks, wires, etc. Logical Effort David Harris Page 44 of 56
45 Delay Plots Normalized delay: d input NAND inverter effort delay g 4/3 p 2 d (4/3)h + 2 g 1 p 1 d h + 1 parasitic delay Electrical effort: h C out / C in o d f + p gh + p o Delay increases with electrical effort o More complex gates have greater logical effort and parasitic delay Logical Effort David Harris Page 45 of 56
46 Example Estimate the frequency of an Nstage ring oscillator: Logical Effort: g 1 Electrical Effort: h C out C in Parasitic Delay: Stage Delay: Oscillator Frequency: p p inv 1 d gh + p 2 F Nd abs Nτ A 31 stage ring oscillator in a 0.18 µm process oscillates at about 670 MHz. Logical Effort David Harris Page 46 of 56
47 Example Estimate the delay of a fanoutof4 (FO4) inverter: d Logical Effort: Electrical Effort: Parasitic Delay: Stage Delay: g 1 h C out C in p p inv 1 d gh + p 5 The FO4 inverter delay is a useful metric to characterize process performance. 1 FO4 delay 5τ This is about 60 ps in a 0.18 µm process. Logical Effort David Harris Page 47 of 56
48 Branching Effort No! Consider circuits that branch: G H GH h 1 h 2 F 1 90 / (15+15) / / , not 18! Introduce new kind of effort to account for branching within a network: o Branching Effort: b C on path + C off path C on path o Path Branching Effort: B Now we can compute the path effort: o Path Effort: F b i GBH Note: h BH H i in circuits that branch Logical Effort David Harris Page 48 of 56
49 Example Select gate sizes y and z to minimize delay from A to B Logical Effort: G ( 4 3) 3 A C y y z z z 9C 9C B 9C Electrical Effort: H C out C in Branching Effort: Path Effort: Best Stage Effort: Delay: B F GHB 128 ˆ f F D Work backward for sizes: 9C ( 4 3) z C 5 3z ( 4 3) y C 5 Logical Effort David Harris Page 49 of 56
50 Example: Number of Stages How many stages should Ben use? o Effort of decoders is dominated by electrical and branching portions 32 3 o Electrical Effort: H o Branching Effort: B 8 because each address input controls half the outputs If we neglect logical effort, o Path Effort: F GBH Remember that the best stage effort is about ρ 4 o Hence, the best number of stages is: o Let s try a 3stage design N log Logical Effort David Harris Page 50 of 56
51 Example: Gate Sizes & Delay Lets try a 3stage design using 16 4input NAND gates with G a 0 a 0 a 1 a 1 a 2 a 2 a 3 a 3 10 unit input capacitance y z out 0 96 unit wordline capacitance y z out 15 o Actual path effort is: o Therefore, stage effort should be: f ( 154) 1 3 z y D 3f + P o o F Close to 4, so f is reasonable Logical Effort David Harris Page 51 of 56
52 Asymmetric Gates Asymmetric logic gates favor one input over another. Example: Suppose input A of a NAND gate is most critical: o Select sizes so pullup and pulldown still match unit inverter o Place critical input closest to output a 2 2 4/3 4 x b o Logical Effort on input A: o Logical Effort on input B: o Total Logical Effort: g A 10 9 g B 2 g tot g A + g B 28 9 Effort on A goes down at expense of effort on B and total gate effort Logical Effort David Harris Page 52 of 56
53 Skewed Gates Skewed gates favor one edge over the other. Example: suppose rising output of inverter is most important. o Downsize noncritical NMOS transistor to reduce total input capacitance a 2 1/2 x a 2 1 x a 1 1/2 x Skewed inverter Unskewed w/ Unskewed w/ equal rise equal fall Compare with unskewed inverter of the same rise/fall time o Logical Effort for rising (up) output: o Logical Effort for falling (down) output: o Average Logical Effort: g u 5 6 g d 5 3 Critical rising effort goes down at expense of noncritical and average effort g avg ( g u + g d ) Logical Effort David Harris Page 53 of 56
54 PseudoNMOS PseudoNMOS gates replace fat PMOS pullups on inputs with a resistive pullup. o Resistive pullup must be much weaker than pulldown stack (e.g. 4x) o Reduces logical effort because inputs must only drive the NMOS transistors o However, NMOS current reduced by contention with pullup o Unequal rising and falling efforts o Logical effort can be applied to domino, pseudonmos, and other logic families Example: PseudoNMOS inverter o Logical Effort for falling (down) output: o Logical Effort for rising (up) output: o Average Logical Effort: g d 4 9 g u 4 3 a 2/3 4/3 g avg ( g u + g d ) x Logical Effort David Harris Page 54 of 56
55 Dynamic Logic Dynamic logic replace fat PMOS pullups on inputs with a clocked precharge. o Reduces logical effort because inputs must only drive the NMOS transistors o Eliminates pseudonmos contention current and power dissipation o Critical pulldown ( evaluation ) delay independent of precharge size Example: Footless dynamic inverter o Logical Effort for falling (down) output: g d 1 3 φ a 1 1 x Robust gates may require keepers and clocked pulldown transistors ( feet ). o Feet prevent contention during precharge but increase logical effort o Weak keepers prevent floating output at cost of slight contention during eval Logical Effort David Harris Page 55 of 56
56 Domino Gates Dynamic gates require monotonically rising inputs. o However, they generate monotonically falling outputs o Alternate dynamic gates with HIskew inverting static gates o Dynamic / static pair is called a domino gate Example: Domino Buffer o Constraints: maximum input capacitance 3, load 54 o Logical Effort: G (1/3) * (5/6) 5/18 o Branching Effort: B 1 o Electrical Effort: H 54/3 18 φ 3 o Path Effort: F (5/18) * 1 * 18 5 o Stage Effort: f o HISkew Inverter: size 54 * (5/6) / o Transistor Sizes: n 4 p 16 a 3 p n g 1 1/3 g 2 5/6 HISkew 54 Logical Effort David Harris Page 56 of 56
Lecture 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 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 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 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 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 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 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 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 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 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 informationVery Large Scale Integration (VLSI)
Very Large Scale Integration (VLSI) Lecture 4 Dr. Ahmed H. Madian Ah_madian@hotmail.com Dr. Ahmed H. MadianVLSI Contents Delay estimation Simple RC model PenfieldRubenstein Model Logical effort Delay
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 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 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 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 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 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 PseudonMOS Logic q Dynamic Logic q
More informationEE M216A.:. Fall Lecture 5. Logical Effort. Prof. Dejan Marković
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
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 (Ratioed logic) W&H 6.2.2 Overview We have now gone through the basics of decoders,
More informationStatic CMOS Circuits. Example 1
Static CMOS Circuits Conventional (ratioless) static CMOS Covered so far Ratioed logic (depletion load, pseudo nmos) Pass transistor logic ECE 261 Krish Chakrabarty 1 Example 1 module mux(input s, d0,
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 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/cpe5705f
More informationDynamic Combinational Circuits. Dynamic Logic
Dynamic Combinational Circuits Dynamic circuits Charge sharing, charge redistribution Domino logic npcmos (zipper CMOS) Krish Chakrabarty 1 Dynamic Logic Dynamic gates use a clocked pmos pullup Two modes:
More informationEE 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 informationDynamic Combinational Circuits. Dynamic Logic
Dynamic Combinational Circuits Dynamic circuits Charge sharing, charge redistribution Domino logic npcmos (zipper CMOS) Krish Chakrabarty 1 Dynamic Logic Dynamic gates use a clocked pmos pullup Two modes:
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 informationInterconnect (2) Buffering Techniques. Logical Effort
Interconnect (2) Buffering Techniques. Logical Effort Lecture 14 18322 Fall 2002 Textbook: [Sections 4.2.1, 8.2.3] A few announcements! M1 is almost over: The checkoff is due today (by 9:30PM) Students
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 informationSkewTolerant Circuit Design
SkewTolerant Circuit Design David Harris David_Harris@hmc.edu December, 2000 Harvey Mudd College Claremont, CA Outline Introduction SkewTolerant Circuits Traditional Domino Circuits SkewTolerant Domino
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 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 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 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 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 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 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 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 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 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 informationSpiral 2 7. Capacitance, Delay and Sizing. Mark Redekopp
27.1 Spiral 2 7 Capacitance, Delay and Sizing Mark Redekopp 27.2 Learning Outcomes I understand the sources of capacitance in CMOS circuits I understand how delay scales with resistance, capacitance
More informationTopics. Dynamic CMOS Sequential Design Memory and Control. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut
Topics Dynamic CMOS Sequential Design Memory and Control Dynamic CMOS In static circuits at every point in time (except when switching) the output is connected to either GND or V DD via a low resistance
More informationLecture 16: Circuit Pitfalls
Introduction to CMOS VLSI Design Lecture 16: Circuit Pitfalls David Harris Harvey Mudd College Spring 2004 Outline Pitfalls Detective puzzle Given circuit and symptom, diagnose cause and recommend solution
More informationLecture 7 Circuit Delay, Area and Power
Lecture 7 Circuit Delay, Area and Power lecture notes from S. Mitra Intro VLSI System course (EE271) Introduction to VLSI Systems 1 Circuits and Delay Introduction to VLSI Systems 2 Power, Delay and Area:
More information9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI Design Chapter III CMOS Device, Inverter, Combinational circuit Logic and Layout Part 3 Combinational Logic Gates (textbook chapter 6) 9/18/2008 GMU, ECE 680 Physical VLSI Design
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 972070751 (daasch@ece.pdx.edu) http://ece.pdx.edu/~ecex25
More informationCARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING DIGITAL INTEGRATED CIRCUITS FALL 2002
CARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING 18322 DIGITAL INTEGRATED CIRCUITS FALL 2002 Final Examination, Monday Dec. 16, 2002 NAME: SECTION: Time: 180 minutes Closed
More informationESE 570: Digital Integrated Circuits and VLSI Fundamentals
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 19: March 29, 2018 Memory Overview, Memory Core Cells Today! Charge Leakage/Charge Sharing " Domino Logic Design Considerations! Logic Comparisons!
More information! Charge Leakage/Charge Sharing. " Domino Logic Design Considerations. ! Logic Comparisons. ! Memory. " Classification. " ROM Memories.
ESE 57: Digital Integrated Circuits and VLSI Fundamentals Lec 9: March 9, 8 Memory Overview, Memory Core Cells Today! Charge Leakage/ " Domino Logic Design Considerations! Logic Comparisons! Memory " Classification
More informationMODULE III PHYSICAL DESIGN ISSUES
VLSI Digital Design MODULE III PHYSICAL DESIGN ISSUES 3.2 Powersupply and clock distribution EE  VDD P2006 3:1 3.1.1 Power dissipation in CMOS gates Power dissipation importance Package Cost. Power
More informationESE 570: Digital Integrated Circuits and VLSI Fundamentals
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 18: March 27, 2018 Dynamic Logic, Charge Injection Lecture Outline! Sequential MOS Logic " DLatch " Timing Constraints! Dynamic Logic " Domino
More informationDigital Integrated Circuits A Design Perspective
Designing ombinational Logic ircuits dapted from hapter 6 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 ombinational vs. Sequential Logic In
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 informationLecture 6 Power Zhuo Feng. Z. Feng MTU EE4800 CMOS Digital IC Design & Analysis 2010
EE4800 CMOS Digital IC Design & Analysis Lecture 6 Power Zhuo Feng 6.1 Outline Power and Energy Dynamic Power Static Power 6.2 Power and Energy Power is drawn from a voltage source attached to the V DD
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 informationEECS 427 Lecture 8: Adders Readings: EECS 427 F09 Lecture 8 1. Reminders. HW3 project initial proposal: due Wednesday 10/7
EECS 427 Lecture 8: dders Readings: 11.111.3.3 3 EECS 427 F09 Lecture 8 1 Reminders HW3 project initial proposal: due Wednesday 10/7 You can schedule a halfhour hour appointment with me to discuss your
More informationEECS 151/251A Homework 5
EECS 151/251A Homework 5 Due Monday, March 5 th, 2018 Problem 1: Timing The datapath 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 informationHw 6 due Thursday, Nov 3, 5pm No lab this week
EE141 Fall 2005 Lecture 18 dders nnouncements Hw 6 due Thursday, Nov 3, 5pm No lab this week Midterm 2 Review: Tue Nov 8, North Gate Hall, Room 105, 6:308:30pm Exam: Thu Nov 10, Morgan, Room 101, 6:308:00pm
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 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 informationMODULE 5 Chapter 7. Clocked Storage Elements
MODULE 5 Chapter 7 Clocked Storage Elements 3/9/2015 1 Outline Background Clocked Storage Elements Timing, terminology, classification Static CSEs Latches Registers Dynamic CSEs Latches Registers 3/9/2015
More informationClock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements.
1 2 Introduction Clock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements. Defines the precise instants when the circuit is allowed to change
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 2018 Final Monday, Apr 0 5 Problems with point weightings shown.
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 EffortA Way of Designing Fast CMOS Circuits (Contd.) Last time,
More informationDigital Integrated Circuits A Design Perspective
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Designing Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL
More informationEE241  Spring 2000 Advanced Digital Integrated Circuits. Announcements
EE241  Spring 2 Advanced Digital Integrated Circuits Lecture 11 Low PowerLow Energy Circuit Design Announcements Homework #2 due Friday, 3/3 by 5pm Midterm project reports due in two weeks  3/7 by 5pm
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 informationLecture 2: CMOS technology. Energyaware computing
EnergyAware Computing Lecture 2: CMOS technology Basic components Transistors Two types: NMOS, PMOS Wires (interconnect) Transistors as switches Gate Drain Source NMOS: When G is @ logic 1 (actually over
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 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 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 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 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 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 informationLecture Outline. ESE 570: Digital Integrated Circuits and VLSI Fundamentals. Review: 1st Order RC Delay Models. Review: TwoInput 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 informationIntroduction to CMOS VLSI Design (E158) Lecture 20: Low Power Design
Harris Introduction to CMOS VLSI Design (E158) Lecture 20: Low Power Design David Harris Harvey Mudd College David_Harris@hmc.edu Based on EE271 developed by Mark Horowitz, Stanford University MAH E158
More informationChapter 11. Inverter. DC AC, Switching. Layout. Sizing PASS GATES (CHPT 10) Other Inverters. Baker Ch. 11 The Inverter. Introduction to VLSI
Chapter 11 Inverter DC AC, Switching Ring Oscillator Dynamic Power Dissipation Layout LATCHUP Sizing PASS GATES (CHPT 10) Other Inverters Joseph A. Elias, Ph.D. Adjunct Professor, University of Kentucky;
More informationLecture 81. Low Power Design
Lecture 8 Konstantinos Masselos Department of Electrical & Electronic Engineering Imperial College London URL: http://cas.ee.ic.ac.uk/~kostas Email: k.masselos@ic.ac.uk Lecture 81 Based on slides/material
More informationTopics to be Covered. capacitance inductance transmission lines
Topics to be Covered Circuit Elements Switching Characteristics Power Dissipation Conductor Sizes Charge Sharing Design Margins Yield resistance capacitance inductance transmission lines Resistance of
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 pretaped on Friday, 2/4, 45:30 203 McLaughlin Class notes are available
More informationLecture 7: Multistage Logic Networks. Best Number of Stages
Lecture 7: Multstage Logc Networks Multstage Logc Networks (cont. from Lec 06) Examples Readng: Ch. Best Number of Stages How many stages should a path use? Mnmzng number of stages s not always fastest
More informationEE115C Digital Electronic Circuits Homework #5
EE115C Digital Electronic Circuits Homework #5 Due Thursday, May 13, 6pm @ 56147E EIV Problem 1 Elmore Delay Analysis Calculate the Elmore delay from node A to node B using the values for the resistors
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 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 informationCMOS Logic Gates. University of Connecticut 172
CMOS Logic Gates University of Connecticut 172 Basic CMOS Inverter Operation V IN P O N O pchannel enhancementtype MOSFET; V T < 0 nchannel enhancementtype MOSFET; V T > 0 If V IN 0, N O is cut off and
More informationEE 560 CHIP INPUT AND OUTPUT (I/0) CIRCUITS. Kenneth R. Laker, University of Pennsylvania
1 EE 560 CHIP INPUT AND OUTPUT (I/0) CIRCUITS 2 > ESD PROTECTION CIRCUITS (INPUT PADS) > ONCHIP CLOCK GENERATION & DISTRIBUTION > OUTPUT PADS > ONCHIP NOISE DUE TO PARASITIC INDUCTANCE > SUPER BUFFER
More informationEE371  Advanced VLSI Circuit Design
EE371  Advanced VLSI Circuit Design Midterm Examination May 1999 Name: No. Points Score 1. 20 2. 24 3. 26 4. 20 TOTAL / 90 In recognition of and in the spirit of the Stanford University Honor Code, I
More informationWhere are we? Data Path Design. Bit Slice Design. Bit Slice Design. Bit Slice Plan
Where are we? Data Path Design Subsystem Design Registers and Register Files dders and LUs Simple ripple carry addition Transistor schematics Faster addition Logic generation How it fits into the datapath
More informationTopics. CMOS Design Multiinput delay analysis. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut
Topics CMO Design Multiinput delay analysis pring 25 Transmission Gate OUT Z OUT Z pring 25 Transmission Gate OUT When is low, the output is at high impedance When is high, the output follows However,
More informationLecture 5: DC & Transient Response
Lecture 5: DC & Transient Response Outline Pass Transistors DC Response Logic Levels and Noise Margins Transient Response RC Delay Models Delay Estimation 2 Pass Transistors We have assumed source is grounded
More informationErrata of K Introduction to VLSI Systems: A Logic, Circuit, and System Perspective
Errata of K13126 Introduction to VLSI Systems: A Logic, Circuit, and System Perspective Chapter 1. Page 8, Table 11) The 0.35µm process parameters are from MOSIS, both 0.25µm and 0.18µm process parameters
More informationHw 6 and 7 Graded and available Project Phase 2 Graded Project Phase 3 Launch Today
EECS141 1 Hw 8 Posted Last one to be graded Due Friday April 30 Hw 6 and 7 Graded and available Project Phase 2 Graded Project Phase 3 Launch Today EECS141 2 1 6 5 4 3 2 1 0 1.5 2 2.5 3 3.5 4 Frequency
More informationTHE INVERTER. Inverter
THE INVERTER DIGITAL GATES Fundamental Parameters Functionality Reliability, Robustness Area Performance» Speed (delay)» Power Consumption» Energy Noise in Digital Integrated Circuits v(t) V DD i(t) (a)
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 informationLogic effort and gate sizing
EEN454 Dgtal Integrated rcut Desgn Logc effort and gate szng EEN 454 Introducton hp desgners face a bewlderng arra of choces What s the best crcut topolog for a functon? How man stages of logc gve least
More informationName: Grade: Q1 Q2 Q3 Q4 Q5 Total. ESE370 Fall 2015
University of Pennsylvania Department of Electrical and System Engineering CircuitLevel Modeling, Design, and Optimization for Digital Systems ESE370, Fall 205 Midterm Wednesday, November 4 Point values
More informationName: Answers. Mean: 83, Standard Deviation: 12 Q1 Q2 Q3 Q4 Q5 Q6 Total. ESE370 Fall 2015
University of Pennsylvania Department of Electrical and System Engineering CircuitLevel Modeling, Design, and Optimization for Digital Systems ESE370, Fall 2015 Final Tuesday, December 15 Problem weightings
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 informationHomework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker
Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker Note: + implies OR,. implies AND, ~ implies NOT Question 1: a) (4%) Use transmission gates to design a 3input OR gate Note: There are
More informationWhere are we? Data Path Design
Where are we? Subsystem Design Registers and Register Files dders and LUs Simple ripple carry addition Transistor schematics Faster addition Logic generation How it fits into the datapath Data Path Design
More informationEE141Fall 2011 Digital Integrated Circuits
EE4Fall 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 information