Lecture 20: Sequential Circuits. Sequencing

Similar documents
Lecture 8: Skew Tolerant Design (including Dynamic Circuit Issues)

EE115C Spring 2013 Digital Electronic Circuits. Lecture 19: Timing Analysis

Chapter 7. Registers & Register Transfers. J.J. Shann. J. J. Shann

Sequential Gates. Gate Level Design. Young Won Lim 3/15/16

Lecture 8: Skew Tolerant Domino Clocking

Finite state machines (cont d)

FSM Optimization. Outline. FSM State Minimization. Some Definitions. Methods 10/14/2015

Practice 10: Ratioed Logic

Derivation of State Graphs and Tables UNIT 14 DERIVATION OF STATE GRAPHS AND TABLES. Designing a Sequential Circuit. Sequence Detectors

Delay Budgeting in Sequential Circuit with Application on FPGA Placement

Statistical Static Timing Analysis: How simple can we get?

Lecture outline W.B. Powell 1

ITM1010 Computer and Communication Technologies

A Heuristic Method for Statistical Digital Circuit Sizing

How Computers Work Lecture 12

The good, the bad and the statistical

Reinforcement Learning

Moving PUFs out of the lab

Physical Unclonable Functions (PUFs) and Secure Processors. Srini Devadas Department of EECS and CSAIL Massachusetts Institute of Technology

Reinforcement Learning. Slides based on those used in Berkeley's AI class taught by Dan Klein

Chapter 9 Theoretical Probability Models


LTE RF Planning Training LTE RF Planning, Design, Optimization Training

Legend expert advisor

91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010

Handout 4: Deterministic Systems and the Shortest Path Problem

RSI 2 System. for Shorter term SWING trading and Longer term TREND following. Dave Di Marcantonio 2016

Chapter 1: Data Storage

10703 Deep Reinforcement Learning and Control

Bits and Bit Patterns. Chapter 1: Data Storage (continued) Chapter 1: Data Storage

A PUF Design for Secure FPGA-Based Embedded Systems

9. Global Supply Chains and Decision Analysis. BIA Supply Chain Analytics

Formal-based Coverage-Driven Verification. Sia Karthik Madabhushi May 15, 2014

CSE Lecture 13/14 In Class Handout For all of these problems: HAS NOT CANNOT Add Add Add must wait until $5 written by previous add;

The OSU Risk Institute Launch. James Lam President ph: ERM and Business Strategy.

Lecture 14: Basic Fixpoint Theorems (cont.)

Computational Independence

CSE 473: Artificial Intelligence

Making Decisions. CS 3793 Artificial Intelligence Making Decisions 1

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration

FPGA PUF Based on Programmable LUT Delays

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration

Business Case Modelling 2 Day Course This course is presented in London on: October, May 2018, November 2018

A PUF Design for Secure FPGA-Based Embedded Systems

Max Registers, Counters and Monotone Circuits

Genetic Algorithm-based Electromagnetic Fault Injection

Simulation. Decision Models

Modeling Logic Gates with Delay- Part#1

While the story has been different in each case, fundamentally, we ve maintained:

A convenient analytical and visual technique of PERT and CPM prove extremely valuable in assisting the managers in managing the projects.

Lecture Data Science

Secure and Energy Efficient Physical Unclonable Functions

Physically Unclonable Functions: a Study on the State of the Art and Future Research Directions.

Non-Deterministic Search

Economics 302 Intermediate Macroeconomic Theory and Policy (Fall 2009) Lecture Nov , 2009

SIMULATION. The objectives of simulation:

Chapter 7 A Multi-Market Approach to Multi-User Allocation

CSEP 573: Artificial Intelligence

DECISION ANALYSIS: INTRODUCTION. Métodos Cuantitativos M. En C. Eduardo Bustos Farias 1

Payday and Small-Dollar, High-Cost Installment Loans

New Function Expected Scenario Outline. Triggered by abnormal disconnection from the TSE trading system

TOSHIBA Field Effect Transistor Silicon N Channel MOS Type RFM07U7X

Optimal Scheduling Policy Determination in HSDPA Networks

TDT4255 Lecture 7: Hazards and exceptions

COMPARISION OF OFFSHORE REQUIREMENTS

Designing with an Inverted-F PCB Antenna

FPS Briefcase. User Guide

Partial Order Reduction in Symbolic State Space Traversal Using ZBDDs

ICO Review: Solve.Care (CAN)

ESD.70J Engineering Economy

Answers to June 11, 2012 Microeconomics Prelim

Binary Options Trading Strategies How to Become a Successful Trader?

Combinational Vs Sequential Logic Combinational circuit. Sequential Circuit ? F. CS221: Digital Design Sequential Logic Design (Latch & FF)

TB General description. 2. Features and benefits. 3. Applications. 4. Pinning information. 5. Ordering information

Warm Up Finitely Repeated Games Infinitely Repeated Games Bayesian Games. Repeated Games

The present value of a single payment of B dollars in year T when the interest rate is R is given by the formula:

ICO Review: SelfKey (KEY)

Optimization 101. Dan dibartolomeo Webinar (from Boston) October 22, 2013

13 Combinational Logic Devices

Anne Bracy CS 3410 Computer Science Cornell University

MiCOM P443-6/P543-7/P841

Making Complex Decisions

The Benefits of a Rule Based Trading System

The Stackable Carry Trade

Business borrowing is generally for two purposes; cashflow and equipment acquisition. The most common forms of borrowings are:

Homing with MEI Motion Card and ASIC-100

Balance Sheet Strategies For Changing Rate Environments

Hello Traders, Cutting Edge Forex Proudly Presents our finest work. Silicon Raptor

The Ramsey Model. Lectures 11 to 14. Topics in Macroeconomics. November 10, 11, 24 & 25, 2008

Temporal Abstraction in RL

SmartCLOSE TM Q&A. DocMagic, Inc All rights reserved.

Logic Selection Guide

Process Optimization Level I (Introduction)

Strategy and Settings for Tradonator nextgen!

Statutory Provisions. LITTLE a VS BIG A. Code Sec. 263(a) Code Sec. 263A. Code Sec. 263A(f) Code Sec. 460(c) INVENTORIES

In Chapter 2, a notional amortization schedule was created that provided a basis

Application of Importance Sampling using Contaminated Normal Distribution to Multidimensional Variation Analysis

Why is this indicator so profitable?

3M Molded Assembly 2 mm x 2 mm 2M Series

Rate Methodology in a FFS HCBS Structure

Transcription:

Lecture 20: Sequential Circuits Sequencing Elements Simple /FF Timing efinitions Source: Ch 7 (W&H) Sequencing Use flip-flops to delay fast tokens so they move through exactly one stage each cycle. Inevitably adds some delay to the slow tokens Sequencing overhead Combinational logic output depends on current inputs Sequential logic output depends on current and previous inputs Called state or tokens Ex: FSM, pipeline in out Finite State Machine Pipeline 1

Sequencing Elements : Level sensitive a.k.a. Flip-flop: edge triggered a.k.a. Timing iagrams Flop (latch) (flop) esign Pass Transistor Pros Cons Used in 1970 s 2

3 esign Transmission gate - Inverting buffer X esign Tristate feedback Buffered input X X

4 esign Buffered output Widely used in standard cells X Flip-Flop esign Flip-flop is built as pair of back-to-back latches X X

Reset Force output low when asserted Synchronous vs. asynchronous Symbol Flop Synchronous Reset Asynchronous Reset Sequencing Methods Flip-flops 2-Phase es Pulsed es Flip-Flops Flop Flop 2-Phase Transparent es Pulsed es 1 2 p 1 2 1 t pw p /2 Combinational Logic t nonoverlap Combinational Logic Half-Cycle 1 Half-Cycle 1 t nonoverlap p 5

Timing iagrams Contamination and Propagation elays A Combinational Logic Y A Y t cd t pd t pd t cd t setup thold Flop t ccq t ccq t pdq t ccq t setup t setup t cdq t pdq Max-elay: Flip-Flops F1 1 2 F2 t setup 1 t pd 2 6

EX T adder =590ps T result_mux =60ps T middle_bypass_mux =80ps T late_bypass_mux =70ps 2mm wire=100ps each T setup =62ps T hold =-10ps T pcq =90ps T pd =1000ps T C >10006290ps Max elay: 2-Phase es tpd tpd1tpd 2 Tc 2tpdq sequencing overhead 1 2 1 1 1 Combinational 2 2 Combinational 3 Logic 1 Logic 2 L1 L2 L3 3 1 2 1 t pdq1 1 t pd1 2 t pdq2 2 t pd2 3 7

Max elay: Pulsed es tpd Tc max tpdq, tpcq tsetup tpw sequencing overhead p p 1 L1 1 2 L2 2 1 t pdq (a) t pw > t setup 1 t pd 2 p (b) t pw < t setup 1 2 t pw tpd tsetup Min-elay: Flip-Flops < t ccq t cd t t t cd hold ccq F1 1 2 F2 1 t ccq t cd 2 8

Min-elay: 2-Phase es T hold <T nonoverlap t ccq d t t t t t cd1, cd 2 hold ccq nonoverlap 1 L1 1 2 2 L2 t nonoverlap 1 2 t ccq 1 t cd 2 Min-elay: Pulsed es p L1 t pw < t ccq t cd t t t t cd hold ccq pw 1 Hold time increased by pulse width p 2 L2 p tpw 1 t ccq t cd 2 9

In a flop-based system: Time Borrowing ata launches on one rising edge Must setup before next rising edge If it arrives late, system fails If it arrives early, time is wasted Flops have hard edges In a latch-based system ata can pass through latch while transparent Long cycle of logic can borrow time into next As long as each loop completes in one cycle Time Borrowing Example 1 2 1 1 2 (a) Combinational Logic Borrowing time across half-cycle boundary Borrowing time across pipeline stage boundary 1 2 (b) Combinational Logic Loops may borrow time internally but must complete within the cycle 10

How Much Borrowing? 2-Phase es T borrow c setup nonoverlap t t t 2 Pulsed es t t t borrow pw setup 1 1 2 L1 1 2 1 L2 2 t pw >t setup 1 2 t nonoverlap /2 Nominal Half-Cycle 1 elay t borrow t setup 2 Skew: Flip-Flops F1 1 2 F2 t T t t t pd c pcq setup skew sequencing overhead t skew t t t t cd hold ccq skew 1 2 t pdq t setup cq d >T skew F1 1 ecreases maximum propagation delay Increases minimum contamination delay 2 F2 t skew 1 t ccq 2 t cd 11

Skew: es 2-Phase es tpd Tc 2tpdq sequencing overhead t, t t t t t cd1 cd 2 hold ccq nonoverlap skew T t t t t 2 c borrow setup nonoverlap skew 1 2 1 2 1 1 1 Combinational 2 2 Combinational 3 Logic 1 Logic 2 L1 Pulsed es t T max t, t t t t pd c pdq pcq setup pw skew sequencing overhead t t t t t cd hold pw ccq t t t t skew borrow pw setup skew L2 L3 3 Two-Phase Clocking If setup times are violated, reduce clock speed If hold times are violated, chip fails at any speed In this class, working chips are most important No tools to analyze clock skew An easy way to guarantee hold times is to use 2-phase latches with big nonoverlap times Call these clocks 1, 2 (ph1, ph2) 12

Summary Flip-Flops: Very easy to use, supported by all tools 2-Phase Transparent es: Lots of skew tolerance and time borrowing Pulsed es: Fast, some skew tol & borrow, hold time risk 13