DOC PREVIEW
Berkeley ELENG 141 - CMOS Gate Design and Circuit Optimization

This preview shows page 1-2-3-4-5 out of 14 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

EE141 Spring 2003 Discussion 7Class DynamicsDigital Circuit Design ConsiderationsLogic Graph & Euler PathStick DiagramA Previous CMOS Design HW ProblemSolution 1 — Logic ComputationSolution 2 — Reverse the PMOSSolution 3 — Logic GraphProject 1 — Clock Driver DesignProject 1 — Grading CriteriaAn Effective ApproachProject — Delay MinimizationProject — Energy optimizationEE141 Spring 2003Discussion 7CMOS Gate Design and Circuit OptimizationRelated Material — Homework 6, Project 1Class Dynamics•Project 1 due next week•No new lab or new homework next week•Lab 6 reports due next week (same time and place as the project)–It serves as a warm up for the project.–The work load there is reasonable, with part f-h assigned for extra credit. The extra credit can be turned in at the week after spring break, as requested by some of you. But evaluate the gain before you paid all the effort in.Digital Circuit Design Considerations•Functionality –Design logic correctly–Increase noise margin and reduce noise •Area –Minimize gate / device count–Do compact layout•Speed–Optimizations on circuit structure, sizing and Vdd … •Power–Minimize the area–Optimizations on sizing and Vdd***Logic Graph & Euler Path•Logic Graph and Euler path are effective tools in CMOS logic design and layout implementation. (Pg. 319)Example of logic graphEuler path: A – B – CStick DiagramEuler path: A – B – CA Previous CMOS Design HW ProblemProblem: Design the NMOS pull down network from the PMOS pull up network–There are actually multiple approaches to solve this problemSolution 1 — Logic ComputationObserved for PMOS PUN:NMOS PDN function can be derived:•A Safe but messy approachSolution 2 — Reverse the PMOS•Find those input patterns which block the PMOS paths from Vdd to F: –AB, CD, AED, BECNMOS PDN function can be derived easily:•More intuitional but be careful in itSolution 3 — Logic Graph•Very effective help-out with this tool•Unfortunately this logic graph doesn’t have a Euler path. Thus just practice with your hw prob. Then. Vdd F D B A C E F GndProject 1 — Clock Driver Design•There do exist a optimum sizing point for each group as the reference result.•But there is no ‘standard’ method or equation leading to this result. — Those are for homework or exam, not for project.•As long as your optimization result is close to the optimum point, and you support it with clear methodology based on design considerations and analysis, you are in good shape.•Actually you should be able to tell in the end whether you get it or not, since you should have understood all the trade offs in the design well if you are doing the right analysis.Project 1 — Grading Criteria•The correctness of your result (is it close to the optimum point?)•Your methodology behind the result (make it logical and CLEAR)•The quality of your report (present your work nicely)–Start working on the report EARLY. Don’t wrap it up 2 hours before the project due. That’ll hurt your effort.An Effective Approach•No matter how complicated the problem is, start from something simple, and then increase your understanding on the whole system, step by step.–Any engineering work is based on a simplified model of the reality. But building the model sometimes requires more expertise than solving it.–You can’t get everything done in one strike. Don’t try to model the whole system with one equation or equation group. –Identify those dominant factors and attack them, then check those others.Project — Delay Minimization•Why we want to increase the size of buffers geometrically?•tp (y) = tp0 (1+y/xγ) + tp0 (1+z/yγ) + …•To minimized tp by sizing the middle inverter —y zx•Conclusion: geometric sizing minimizes buffer chain delay!Project — Energy optimization•Why happens with energy optimization?0.8*x2Delay ↑Delay ↓Delay →•Obviously the gate with the largest size deserves an attack —–If its size is reduced by 20%, the total energy reduction ~ 20%–Delay of this final stage increase by less than 25%. Delay of the middle stage decreases. Thus the overall delay should increase by less than 8%. –Then how about the sizing of stages before the last one?–And what if we optimize the Vdd at the same


View Full Document

Berkeley ELENG 141 - CMOS Gate Design and Circuit Optimization

Documents in this Course
Adders

Adders

7 pages

Memory

Memory

33 pages

I/O

I/O

14 pages

Lecture 8

Lecture 8

34 pages

Lab 3

Lab 3

2 pages

I/O

I/O

17 pages

Project

Project

6 pages

Adders

Adders

15 pages

SRAM

SRAM

13 pages

Load more
Download CMOS Gate Design and Circuit Optimization
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view CMOS Gate Design and Circuit Optimization and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view CMOS Gate Design and Circuit Optimization 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?