Timing Analysis with Clock Skew
|
|
- Darlene Dean
- 6 years ago
- Views:
Transcription
1 , Mark Horowitz 1, & Dean Liu 1 David_Harris@hmc.edu, {horowitz, dliu}@vlsi.stanford.edu March, 1999 Harvey Mudd College Claremont, CA 1 (with Stanford University, Stanford, CA)
2 Outline Introduction Timing Analysis Formulation Timing Verification Algorithm Results Conclusion
3 Introduction Clock skew, as a fraction of the cycle time, is a growing problem for fast chips Fewer gate delays per cycle Poor transistor length, threshold tolerances Larger clock loads Bigger dice
4 Introduction Clock skew, as a fraction of the cycle time, is a growing problem for fast chips Fewer gate delays per cycle Poor transistor length, threshold tolerances Larger clock loads Bigger dice The designer may: Reduce skew Very hard; clock networks are already well optimized
5 Introduction Clock skew, as a fraction of the cycle time, is a growing problem for fast chips Fewer gate delays per cycle Poor transistor length, threshold tolerances Larger clock loads Bigger dice The designer may: Reduce skew Very hard; clock networks are already well optimized Tolerate skew Flip-flops and traditional domino circuits reduce cycle time by skew es and skew-tolerant domino can hide modest amounts of skew
6 Introduction Clock skew, as a fraction of the cycle time, is a growing problem for fast chips Fewer gate delays per cycle Poor transistor length, threshold tolerances Larger clock loads Bigger dice The designer may: Reduce skew Very hard; clock networks are already well optimized Tolerate skew Flip-flops and traditional domino circuits reduce cycle time by skew es and skew-tolerant domino can hide modest amounts of skew Only budget necessary skews Skew between nearby latches is often much less than skew across die Need better timing analysis for different skews between different latches
7 Timing Analysis Formulation Build on Sakallah, Mudge, Olukotun (SMO) analysis of latch-based systems. System contains: k clocks C = {, φ 2,..., φ k ) l latches L = {L 1, L 2,..., L l } φ 2 φ 2 L 1 L 2 L 3
8 Clock Waveforms 0 T c φ 2 φ 2 L 1 L 2 L 3 T c : cycle time
9 Clock Waveforms 0 T c Tφ1 = T c /2 T φ2 = T c /2 φ 2 φ 2 L 1 L 2 L 3 T c T φi : cycle time : duration for which φ i is high
10 Clock Waveforms 0 T T φ1 = T c /2 c φ 2 s φ1 = 0 s φ2 = T c /2 T φ2 = T c /2 φ 2 L 1 L 2 L 3 T c T φi s φi : cycle time : duration for which φ i is high : start time, relative to beginning of common clock, of φ i being high
11 Clock Waveforms 0 T T φ1 = T c /2 c φ 2 s φ1 = 0 s φ2 = T c /2 T φ2 = T c /2 S φ1φ2 = S φ2φ1 = -T c /2 φ 2 L 1 L 2 L 3 T c T φi s φi S φi φ j : cycle time : duration for which φ i is high : start time, relative to beginning of common clock, of φ i being high : phase shift from φ i to next occurrence of φ j. Used to translate times relative to particular clock phases.
12 Variables p i : clock phase controlling latch i φ 2 φ 2 L 1 L 2 L 3 p 1 : 1 p 2 : 2 p 3 : 1
13 Variables p i : clock phase controlling latch i DCi : setup time for latch i φ 2 φ 2 L 1 L 2 L 3 p 1 : 1 p 2 : 2 p 3 : 1
14 Variables p i : clock phase controlling latch i DCi DQi : setup time for latch i : propagation delay through latch i φ 2 φ 2 L 1 L 2 L 3 p 1 : 1 p 2 : 2 p 3 : 1
15 Variables p i : clock phase controlling latch i DCi DQi Assume: : setup time for latch i : propagation delay through latch i T c DQ = 1000 ps = 80 ps φ φ 2 L 1 L 2 L 3 12 = =70 p 1 : 1 p 2 : 2 p 3 : 1 ij : propagation delay through logic between latches i and j
16 Variables p i : clock phase controlling latch i DCi DQi Assume: : setup time for latch i : propagation delay through latch i T c DQ = 1000 ps = 80 ps φ φ 2 L 1 L 2 L 3 12 = =70 p 1 : 1 p 2 : 2 p 3 : 1 A 1 : 0 ps A 2 : 250 A 3 : -100 ij A i : propagation delay through logic between latches i and j : arrival time at latch i, relative to start of p i
17 Variables p i : clock phase controlling latch i DCi DQi Assume: : setup time for latch i : propagation delay through latch i T c DQ = 1000 ps = 80 ps φ φ 2 L 1 L 2 L 3 12 = =70 p 1 : 1 p 2 : 2 p 3 : 1 A 1 : 0 ps A 2 : 250 A 3 : -100 D 1 : 0 D 2 : 250 D 3 : 0 ij A i D i : propagation delay through logic between latches i and j : arrival time at latch i, relative to start of p i : departure time from latch i
18 Variables p i : clock phase controlling latch i DCi DQi Assume: : setup time for latch i : propagation delay through latch i T c DQ = 1000 ps = 80 ps φ φ 2 L 1 L 2 L 3 12 = =70 p 1 : 1 p 2 : 2 p 3 : 1 A 1 : 0 ps A 2 : 250 A 3 : -100 D 1 : 0 D 2 : 250 D 3 : 0 Q 1 : 80 Q 2 : 330 Q 3 : 80 ij A i D i Q i : propagation delay through logic between latches i and j : arrival time at latch i, relative to start of : departure time from latch i : output time of latch i p i
19 Timing Constraints Departure: i L D i = max( 0A, i )
20 Timing Constraints Departure: i L D i = max( 0A, i ) Output: i L Q i = D i + DQi
21 Timing Constraints Departure: i L D i = max( 0A, i ) Output: i L Q i = D i + DQi Arrival: ij, L A i = max( Q j + ji + S pj p ) i
22 Timing Constraints Departure: i L D i = max( 0A, i ) Output: i L Q i = D i + DQi Arrival: ij, L A i = max( Q j + ji + S pj p ) i Propagation Constraints: ij, L D i = max( 0max, ( D j + DQj + ji + S pj p ) i
23 Timing Constraints Departure: i L D i = max( 0A, i ) Output: i L Q i = D i + DQi Arrival: ij, L A i = max( Q j + ji + S pj p ) i Propagation Constraints: ij, L D i = max( 0max, ( D j + DQj + ji + S pj p ) i Setup Constraints: i L D i + DCi T pi
24 Clock skew is the difference between nominal and actual interarrival times of a pair of clocks. Enlarge set of physical clocks C to model skew between nominally identical clocks. Example: φ 2a L 3 D 3 C = {a, φ 2a, b, φ 2b } local t skew within domains a 4 L 4 D 4 b 6 L 6 D 6 global t skew between domains 5 7 φ 2a L 5 D 5 φ 2b L 7 D 7 ALU (clock domain a) Data Cache (clock domain b)
25 Single Skew Formulation Easy and conservative to budget global skew everywhere Effectively increases setup time at each latch Setup Constraints: global i L D i + DCi + t skew T pi Too conservative for high-speed designs with big global skews
26 Exact Skew Budgets How much skew must be budgeted? L 3 to L 4 : local skew φ 2a L 3 D a L 4 D 4 b L 6 D φ 2a L 5 D 5 φ 2b L 7 D 7 ALU (clock domain a) Data Cache (clock domain b)
27 Exact Skew Budgets How much skew must be budgeted? L 3 to L 4 : L 7 to L 4 : local skew global skew φ 2a L 3 D a L 4 D 4 b L 6 D φ 2a L 5 D 5 φ 2b L 7 D 7 ALU (clock domain a) Data Cache (clock domain b)
28 Exact Skew Budgets How much skew must be budgeted? L 3 to L 4 : local skew L 7 to L 4 : global skew L 5 to L 4 through transparent L 6, L 7 : local skew Must track launching clock to determine skew budget D 3 φ 2a L a L 4 D 4 b L 6 D φ 2a L 5 D 5 φ 2b L 7 D 7 ALU (clock domain a) Data Cache (clock domain b)
29 Exact Skew Formulation Define arrival and departure times with respect to launching clocks: A i c D i c φ i, φ j t skew : arrival time at latch i for path launched by clock c : departure time from latch i for path launched by clock c : skew between clocks φ i, φ j
30 Negative Departure Times Must now allow negative departure times with respect to other clocks: Path from L 5 to L 7 is earlier than L 6 to L 7, but sees more skew, miss setup Reaches L 6 at -50 ps, but L 6 may be transparent by then because of skew Departure times w.r.t. latch s own clock still must be nonnegative φ 2a L 3 T c = 1000 ps a φ 2a ps L 4 b L ps L φ 5 2b L 7 2a D 6 1b D 6 2a D 7 1b D 7 = 50 = 0 = 400 = 450 ALU (clock domain a) Data Cache (clock domain b) 2a, 2b t skew 1b, 2b t skew = = DC = 0 DQ = ps 25 ps
31 Exact Constraints with Skew: Propagation Constraints (single skew): ij, L D i = max( 0max, ( D j + DQj + ji + S pj p ) i Setup Constraints (single skew): global i L D i + DCi + t skew T pi Propagation Constraints (exact skew): ij, Lc, C if c = p i c c then D i = max( 0max, ( D j + DQj + ji + S pj p )) i c c else D i = max( D j + DQj + ji + S pj p ) i Setup Constraints (exact skew): i Lc, C D i c + + DCi cp, i t skew T pi
32 Other Timing Constraints Flip-flops: No transparency, easier than latches Still budget skew between launching and receiving clocks Min-delay: Only requires checks between consecutive pairs of clocked elements Standard verification algorithms work if proper skew is used
33 Verification Algorithm Check constraints with generalized Szymanski-Shenoy relaxation algorithm 1 For each latch i: p 2 i max max D i = 0 ; Di = 0; c i = // initialize departure times 3 Enqueue 4 While queue is not empty 5 Dequeue 6 For each latch i in fanout of j c 7 A = D j // calculate arrival time c 8 If A> D i AND c max i, c // is it possibly critical? cp, 9 If ( + + i > ) // does it violate setup time? 10 Report setup time violation 11 Else D i p i D j c DQj ji S pj p i c c 12 D i = A; Enqueue D i // keep following path max max 13 If ( A> D i ) D i A; p i ( ) A t + skew A DCi t skew T pi > D i max max = c i = c
34 Results Analyzed MAGIC: Memory & General Interconnect Controller of FLASH supercomputer Assume local t skew global = 250ps t skew Model A: As designed, from MAGIC.sdf database Model B: Flops converted to latch pairs, logic balanced between pairs = 500ps
35 Results Analyzed MAGIC: Memory & General Interconnect Controller of FLASH supercomputer Assume local t skew global = 250ps t skew Model A: As designed, from MAGIC.sdf database Model B: Flops converted to latch pairs, logic balanced between pairs CPU time < 1 second in all cases = 500ps Model A # Flip-Flops Model B # es Single Skew T c 9.43 ns 8.05 ns # Departures Checked Exact Skew T c # Departures Checked
36 Conclusions Global skews will be too large for GHz + systems Use skew-tolerant circuit techniques such as latches Take advantage of smaller local skews where possible Requires support of timing analyzer Budget appropriate skew at each receiver Track departure times with respect to launching clocks Allow negative departure times with respect to other clocks Leads to explosion in number of timing constraints. However... Most are not tight because most critical paths do not borrow time across many latches Relaxation algorithm automatically prunes loose constraints Very small increase in runtime Expect synchronous systems well beyond 1 GHz
Skew-Tolerant Circuit Design
Skew-Tolerant Circuit Design David Harris David_Harris@hmc.edu December, 2000 Harvey Mudd College Claremont, CA Outline Introduction Skew-Tolerant Circuits Traditional Domino Circuits Skew-Tolerant Domino
More informationEE115C Winter 2017 Digital Electronic Circuits. Lecture 19: Timing Analysis
EE115C Winter 2017 Digital Electronic Circuits Lecture 19: Timing Analysis Outline Timing parameters Clock nonidealities (skew and jitter) Impact of Clk skew on timing Impact of Clk jitter on timing Flip-flop-
More informationThe Linear-Feedback Shift Register
EECS 141 S02 Timing Project 2: A Random Number Generator R R R S 0 S 1 S 2 1 0 0 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 0 0 1 1 0 0 The Linear-Feedback Shift Register 1 Project Goal Design a 4-bit LFSR SPEED, SPEED,
More informationTiming Issues. Digital Integrated Circuits A Design Perspective. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolić. January 2003
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolić Timing Issues January 2003 1 Synchronous Timing CLK In R Combinational 1 R Logic 2 C in C out Out 2
More informationProblem Set 9 Solutions
CSE 26 Digital Computers: Organization and Logical Design - 27 Jon Turner Problem Set 9 Solutions. For each of the sequential circuits shown below, draw in the missing parts of the timing diagrams. You
More informationGMU, ECE 680 Physical VLSI Design 1
ECE680: Physical VLSI Design Chapter VII Timing Issues in Digital Circuits (chapter 10 in textbook) GMU, ECE 680 Physical VLSI Design 1 Synchronous Timing (Fig. 10 1) CLK In R Combinational 1 R Logic 2
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 informationTHE UNIVERSITY OF MICHIGAN. Faster Static Timing Analysis via Bus Compression
Faster Static Timing Analysis via Bus Compression by David Van Campenhout and Trevor Mudge CSE-TR-285-96 THE UNIVERSITY OF MICHIGAN Computer Science and Engineering Division Department of Electrical Engineering
More informationLecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM
Lecture 9: Clocking, Clock Skew, Clock Jitter, Clock Distribution and some FM Mark McDermott Electrical and Computer Engineering The University of Texas at Austin 9/27/18 VLSI-1 Class Notes Why Clocking?
More informationXarxes de distribució del senyal de. interferència electromagnètica, consum, soroll de conmutació.
Xarxes de distribució del senyal de rellotge. Clock skew, jitter, interferència electromagnètica, consum, soroll de conmutació. (transparències generades a partir de la presentació de Jan M. Rabaey, Anantha
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 informationEECS 427 Lecture 14: Timing Readings: EECS 427 F09 Lecture Reminders
EECS 427 Lecture 14: Timing Readings: 10.1-10.3 EECS 427 F09 Lecture 14 1 Reminders CA assignments Please submit CA6 by tomorrow noon CA7 is due in a week Seminar by Prof. Bora Nikolic SRAM variability
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Summer 2017 State-Holding Elements Bistable Elements S Latch Latch Positive-Edge-Triggered Flip-Flop Flip-Flop with
More informationLecture 9: Sequential Logic Circuits. Reading: CH 7
Lecture 9: Sequential Logic Circuits Reading: CH 7 Sequential Logic FSM (Finite-state machine) Inputs Current State COMBINATIONAL LOGIC Registers Outputs = f(current, inputs) Next state 2 storage mechanisms
More informationCSE241 VLSI Digital Circuits Winter Lecture 07: Timing II
CSE241 VLSI Digital Circuits Winter 2003 Lecture 07: Timing II CSE241 L3 ASICs.1 Delay Calculation Cell Fall Cap\Tr 0.05 0.2 0.5 0.01 0.02 0.16 0.30 0.5 2.0 0.04 0.32 0.178 0.08 0.64 0.60 1.20 0.1ns 0.147ns
More informationLecture 25. Dealing with Interconnect and Timing. Digital Integrated Circuits Interconnect
Lecture 25 Dealing with Interconnect and Timing Administrivia Projects will be graded by next week Project phase 3 will be announced next Tu.» Will be homework-like» Report will be combined poster Today
More informationTHE UNIVERSITY OF MICHIGAN. Timing Analysis of Domino Logic
Timing Analsis of Domino Logic b David Van Campenhout, Trevor Mudge and Karem Sakallah CSE-T-296-96 THE UNIVESITY O MICHIGAN Computer Science and Engineering Division Department of Electrical Engineering
More informationChapter 7 Sequential Logic
Chapter 7 Sequential Logic SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} March 28, 2016 Table of Contents 1 Intro 2 Bistable Circuits 3 FF Characteristics
More informationINTEGRATED CIRCUITS. For a complete data sheet, please also download:
INTEGRATED CIRCUITS DATA SHEET For a complete data sheet, please also download: The IC06 74HC/HCT/HCU/HCMOS Logic Family Specifications The IC06 74HC/HCT/HCU/HCMOS Logic Package Information The IC06 74HC/HCT/HCU/HCMOS
More informationIssues on Timing and Clocking
ECE152B TC 1 Issues on Timing and Clocking X Combinational Logic Z... clock clock clock period ECE152B TC 2 Latch and Flip-Flop L CK CK 1 L1 1 L2 2 CK CK CK ECE152B TC 3 Clocking X Combinational Logic...
More informationHomework #4. CSE 140 Summer Session Instructor: Mohsen Imani. Only a subset of questions will be graded
Homework #4 CSE 140 Summer Session 2 2017 Instructor: Mohsen Imani Only a subset of questions will be graded 1) For the circuit shown below, do the following: a. Write a logic equation for the output P
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 " D-Latch " Timing Constraints! Dynamic Logic " Domino
More informationData AND. Output AND. An Analysis of Pipeline Clocking. J. E. Smith. March 19, 1990
An Analysis of Pipeline locking J E Smith March 19, 1990 Abstract This note examines timing constraints on latches in pipelined systems The goal is to determine required clock characteristics based on
More informationStatistical Clock Skew Modeling with Data Delay Variations
Statistical Clock Skew Modeling with Data Delay Variations Abstract David Harris 1 and Sam Naffziger 2 David_Harris@hmc.edu, sdn@fc.hp.com Accurate clock skew budgets are important for microprocessor designers
More informationEE371 - Advanced VLSI Circuit Design
EE371 - Advanced VLSI Circuit Design Midterm Examination May 7, 2002 Name: No. Points Score 1. 18 2. 22 3. 30 TOTAL / 70 In recognition of and in the spirit of the Stanford University Honor Code, I certify
More informationALU, Latches and Flip-Flops
CSE14: Components and Design Techniques for Digital Systems ALU, Latches and Flip-Flops Tajana Simunic Rosing Where we are. Last time: ALUs Plan for today: ALU example, latches and flip flops Exam #1 grades
More informationEE241 - Spring 2007 Advanced Digital Integrated Circuits. Announcements
EE241 - Spring 2007 Advanced Digital Integrated Circuits Lecture 25: Synchronization Timing Announcements Homework 5 due on 4/26 Final exam on May 8 in class Project presentations on May 3, 1-5pm 2 1 Project
More informationLecture 10: Sequential Networks: Timing and Retiming
Lecture 10: Sequential Networks: Timing and Retiming CSE 140: Components and Design Techniques for Digital Systems Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego
More informationStatistical Clock Skew Modeling With Data Delay Variations
888 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 9, NO. 6, DECEMBER 2001 Statistical Clock Skew Modeling With Data Delay Variations David Harris and Sam Naffziger Abstract Accurate
More informationClocked Synchronous State-machine Analysis
Clocked Synchronous State-machine Analysis Given the circuit diagram of a state machine: Analyze the combinational logic to determine flip-flop input (excitation) equations: D i = F i (Q, inputs) The input
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
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 informationTiming Constraints in Sequential Designs. 63 Sources: TSR, Katz, Boriello & Vahid
Timing Constraints in Sequential esigns 63 Sources: TSR, Katz, Boriello & Vahid Where we are now. What we covered last time: FSMs What we ll do next: Timing constraints Upcoming deadlines: ZyBook today:
More informationDesigning Sequential Logic Circuits
igital Integrated Circuits (83-313) Lecture 5: esigning Sequential Logic Circuits Semester B, 2016-17 Lecturer: r. Adam Teman TAs: Itamar Levi, Robert Giterman 26 April 2017 isclaimer: This course was
More informationA Random Walk from Async to Sync. Paul Cunningham & Steev Wilcox
A Random Walk from Async to Sync Paul Cunningham & Steev Wilcox Thank You Ivan In the Beginning March 2002 Azuro Day 1 Some money in the bank from Angel Investors 2 employees Small Office rented from Cambridge
More informationTAU 2014 Contest Pessimism Removal of Timing Analysis v1.6 December 11 th,
TU 2014 Contest Pessimism Removal of Timing nalysis v1.6 ecember 11 th, 2013 https://sites.google.com/site/taucontest2014 1 Introduction This document outlines the concepts and implementation details necessary
More informationLecture 27: Latches. Final presentations May 8, 1-5pm, BWRC Final reports due May 7 Final exam, Monday, May :30pm, 241 Cory
EE241 - Spring 2008 Advanced Digital Integrated Circuits Lecture 27: Latches Timing Announcements Wrapping-up the class: Final presentations May 8, 1-5pm, BWRC Final reports due May 7 Final exam, Monday,
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
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 informationJin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering. Jungli, Taiwan
Chapter 7 Sequential Circuits Jin-Fu Li Advanced Reliable Systems (ARES) Lab. epartment of Electrical Engineering National Central University it Jungli, Taiwan Outline Latches & Registers Sequencing Timing
More informationiretilp : An efficient incremental algorithm for min-period retiming under general delay model
iretilp : An efficient incremental algorithm for min-period retiming under general delay model Debasish Das, Jia Wang and Hai Zhou EECS, Northwestern University, Evanston, IL 60201 Place and Route Group,
More informationLecture 23. Dealing with Interconnect. Impact of Interconnect Parasitics
Lecture 23 Dealing with Interconnect Impact of Interconnect Parasitics Reduce Reliability Affect Performance Classes of Parasitics Capacitive Resistive Inductive 1 INTERCONNECT Dealing with Capacitance
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 informationINTEGRATED CIRCUITS. For a complete data sheet, please also download:
INTEGRATED CIRCUITS DATA SEET For a complete data sheet, please also download: The IC0 74C/CT/CU/CMOS Logic Family Specifications The IC0 74C/CT/CU/CMOS Logic Package Information The IC0 74C/CT/CU/CMOS
More informationFor smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]
More informationSkew Management of NBTI Impacted Gated Clock Trees
International Symposium on Physical Design 2010 Skew Management of NBTI Impacted Gated Clock Trees Ashutosh Chakraborty and David Z. Pan ECE Department, University of Texas at Austin ashutosh@cerc.utexas.edu
More informationDual D Flip-Flop with Set and Reset High-Speed Silicon-Gate CMOS
TECHNICAL DATA IN74ACT74 Dual D Flip-Flop with Set and Reset High-Speed Silicon-Gate CMOS The IN74ACT74 is identical in pinout to the LS/ALS74, HC/HCT74. The IN74ACT74 may be used as a level converter
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 informationMOSIS REPORT. Spring MOSIS Report 1. MOSIS Report 2. MOSIS Report 3
MOSIS REPORT Spring 2010 MOSIS Report 1 MOSIS Report 2 MOSIS Report 3 MOSIS Report 1 Design of 4-bit counter using J-K flip flop I. Objective The purpose of this project is to design one 4-bit counter
More informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationA Mathematical Solution to. by Utilizing Soft Edge Flip Flops
A Mathematical Solution to Power Optimal Pipeline Design by Utilizing Soft Edge Flip Flops M. Ghasemazar, B. Amelifard, M. Pedram University of Southern California Department of Electrical Engineering
More informationDistributed by: www.jameco.com 1-800-831-4242 The content and copyrights of the attached material are the property of its owner. INTEGRATED CIRCUITS DATA SHEET For a complete data sheet, please also download:
More informationCMSC 313 Lecture 25 Registers Memory Organization DRAM
CMSC 33 Lecture 25 Registers Memory Organization DRAM UMBC, CMSC33, Richard Chang A-75 Four-Bit Register Appendix A: Digital Logic Makes use of tri-state buffers so that multiple registers
More informationDigital Logic Design - Chapter 4
Digital Logic Design - Chapter 4 1. Analyze the latch circuit shown below by obtaining timing diagram for the circuit; include propagation delays. Y This circuit has two external input and one feedback
More informationCombinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13
Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Administrative Re: Midterm Exam #2 Graded! 5/22/18
More informationTopics. CMOS Design Multi-input delay analysis. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut
Topics CMO Design Multi-input 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 informationEE141- Spring 2007 Digital Integrated Circuits
EE141- Spring 27 igital Integrated Circuits Lecture 19 Sequential Circuits 1 Administrative Stuff Project Ph. 2 due Tu. 5pm 24 Cory box + email ee141- project@bwrc.eecs.berkeley.edu Hw 8 Posts this Fr.,
More informationEE382 Processor Design Winter 1999 Chapter 2 Lectures Clocking and Pipelining
Slide 1 EE382 Processor Design Winter 1999 Chapter 2 Lectures Clocking and Pipelining Slide 2 Topics Clocking Clock Parameters Latch Types Requirements for reliable clocking Pipelining Optimal pipelining
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 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 informationDigital Integrated Circuits A Design Perspective
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning Sequential Logic Circuits November 2002 Naming Conventions In our text: a latch is level sensitive
More informationABSTRACT TIMING VERIFICATION AND OPTIMIZATION OF CIRCUITS WITH LEVEL-SENSITIVE LATCHES. by Timothy Michael Burks
ABSTRACT TIMING VERIFICATION AND OPTIMIZATION OF CIRCUITS WITH LEVEL-SENSITIVE LATCHES by Timothy Michael Burks Chair: Karem Sakallah This work describes the development of a model for the static timing
More informationCMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan,
More informationGMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
More informationHomework 2 due on Wednesday Quiz #2 on Wednesday Midterm project report due next Week (4 pages)
EE241 - Spring 2013 Advanced Digital Integrated Circuits Lecture 12: SRAM Design ECC Timing Announcements Homework 2 due on Wednesday Quiz #2 on Wednesday Midterm project report due next Week (4 pages)
More information9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
More informationDigital Integrated Circuits A Design Perspective
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL LOGIC
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationLecture 17: Designing Sequential Systems Using Flip Flops
EE210: Switching Systems Lecture 17: Designing Sequential Systems Using Flip Flops Prof. YingLi Tian April 11, 2019 Department of Electrical Engineering The City College of New York The City University
More informationJan M. Rabaey Anantha Chandrakasan Borivoje Nikolic. November Digital Integrated Circuits 2nd Sequential Circuits
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning i Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL
More informationReview for Final Exam
CSE140: Components and Design Techniques for Digital Systems Review for Final Exam Mohsen Imani CAPE Please submit your evaluations!!!! RTL design Use the RTL design process to design a system that has
More informationEECS 427 Lecture 15: Timing, Latches, and Registers Reading: Chapter 7. EECS 427 F09 Lecture Reminders
EECS 427 Lecture 15: Timing, Latches, and Registers Reading: Chapter 7 1 Reminders CA assignments CA7 is due Thursday at noon ECE Graduate Symposium Poster session in ECE Atrium on Friday HW4 (detailed
More informationMethodology to Achieve Higher Tolerance to Delay Variations in Synchronous Circuits
Methodology to Achieve Higher Tolerance to Delay Variations in Synchronous Circuits Emre Salman and Eby G. Friedman Department of Electrical and Computer Engineering University of Rochester Rochester,
More informationLatch/Register Scheduling For Process Variation
Latch/Register Scheduling For Process Variation Aaron P. Hurst Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720 ahurst@eecs.berkeley.edu Abstract
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationINTEGRATED CIRCUITS. For a complete data sheet, please also download:
INTEGRATED CIRCUITS DATA SEET For a complete data sheet, please also download: The IC0 74C/CT/CU/CMOS ogic Family Specifications The IC0 74C/CT/CU/CMOS ogic Package Information The IC0 74C/CT/CU/CMOS ogic
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 informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationStructural Delay Testing Under Restricted Scan of Latch-based Pipelines with Time Borrowing
Structural Delay Testing Under Restricted Scan of Latch-based Pipelines with Borrowing Kun Young Chung and Sandeep K. Gupta University of Southern California, EE Systems Abstract High-speed circuits use
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 information74F193 Up/Down Binary Counter with Separate Up/Down Clocks
April 1988 Revised September 2000 Up/Down Binary Counter with Separate Up/Down Clocks General Description The is an up/down modulo-16 binary counter. Separate Count Up and Count Down Clocks are used, and
More informationCPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic
CPE/EE 422/522 Chapter - Review of Logic Design Fundamentals Dr. Rhonda Kay Gaede UAH UAH Chapter CPE/EE 422/522. Combinational Logic Combinational Logic has no control inputs. When the inputs to a combinational
More informationLecture #4: Potpourri
Lecture #4: Potpourri Paul Hartke Phartke@stanford.edu Stanford EE183 April 15, 2002 Tutorial/Verilog Questions? Tutorial is mostly done, right? Due tonight at Midnight (Mon 4/14/02) Turn in copies of
More informationUNIVERSITY OF CALIFORNIA
UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences Last modified on April 14, 2004 by Brian Leibowitz (bsl@eecs.berkeley.edu) Jan Rabaey Homework
More informationTopic 8: Sequential Circuits
Topic 8: Sequential Circuits Readings : Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential circuits Introduction to the concept of the
More informationChapter 3. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 3 <1>
Chapter 3 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 3 Chapter 3 :: Topics Introduction Latches and Flip-Flops Synchronous Logic Design Finite
More informationVidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution
S.E. Sem. III [ETRX] Digital Circuits and Design Prelim uestion Paper Solution. (a) Static Hazard Static hazards have two cases: static and static. static- hazard exists when the output variable should
More informationItanium TM Processor Clock Design
Itanium TM Processor Design Utpal Desai 1, Simon Tam, Robert Kim, Ji Zhang, Stefan Rusu Intel Corporation, M/S SC12-502, 2200 Mission College Blvd, Santa Clara, CA 95052 ABSTRACT The Itanium processor
More informationDesign for Variability and Signoff Tips
Design for Variability and Signoff Tips Alexander Tetelbaum Abelite Design Automation, Walnut Creek, USA alex@abelite-da.com ABSTRACT The paper provides useful design tips and recommendations on how to
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationINTEGRATED CIRCUITS. For a complete data sheet, please also download:
INTEGRATED CIRCUITS DATA SEET For a complete data sheet, please also download: The IC6 74C/CT/CU/CMOS ogic Family Specifications The IC6 74C/CT/CU/CMOS ogic Package Information The IC6 74C/CT/CU/CMOS ogic
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
More informationEECS 579: Logic and Fault Simulation. Simulation
EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for
More informationSequential Logic Worksheet
Sequential Logic Worksheet Concept Inventory: Notes: D-latch & the Dynamic Discipline D-register Timing constraints for sequential circuits Set-up and hold times for sequential circuits 6.004 Worksheet
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationVLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) True-value Simulator
Design Verification Simulation used for ) design verification: verify the correctness of the design and 2) test verification. Design verification: Response analysis Specification Design(netlist) Critical
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More information