Timing Analysis Section 2.4.2. Delay Time Def: Time required for output signal Y to change due to change in input signal X Up to now, we have assumed.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

Logic Gates.
Logic Gates.
CT455: Computer Organization Logic gate
topics Logic gates Gates types Universal gates
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

XOR, XNOR, and Binary Adders
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Basic logic gates  AND gate:The truth table is given by A.BBA
Linear Delay Model In general the propagation delay of a gate can be written as: d = f + p –p is the delay due to intrinsic capacitance. –f is the effort.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
October 2004Computer Hardware Lecture 5 Slide1 / 29 Lecture 5 Physical Realisation of Logic Gates.
EEL-3705 TPS QUIZZES Chapters 6,7,8. Quiz 1 Quiz Design a FSM which implements the state equations given below.
FAMU-FSU College of Engineering EEL 3705 / 3705L Digital Logic Design Fall 2006 Instructor: Dr. Michael Frank Module #12: Combinational Logic Cost & Timing.
Timing Analysis Section Delay Time Def: Time required for output signal Y to change due to change in input signal X Up to now, we have assumed.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Topic 4 – Switching Circuits. Serial vs. Parallel Transmission Circuit elements can be connected in either a serial or parallel manner. Serial implies.
Circuit Delay Performance Estimation Most digital designs have multiple signal paths and the slowest one of these paths is called the critical path Timing.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Circuit Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Combinational Circuits Part 1
Eng. Mai Z. Alyazji October, 2016
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Technology.
ECE 3130 Digital Electronics and Design
Logic Gates.
EI205 Lecture 5 Dianguang Ma Fall 2008.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
NAND Gate Truth table To implement the design,
Digital Signals Digital Signals have two basic states:
Dr. Clincy Professor of CS
XOR, XNOR, and Binary Adders
Digital Fundamentals Floyd Chapter 5 Tenth Edition
XOR, XNOR, & Binary Adders
King Fahd University of Petroleum and Minerals
Waveforms & Timing Diagrams
Logic Gates.
Week 7: Gates and Circuits: PART II
CS Chapter 3 (3A and ) Part 3 of 8
Logic Gates.
Logic Gates.
KS4 Electricity – Electronic systems
CS Chapter 3 (3A and ) – Part 2 of 5
Digital Fundamentals Floyd Chapter 5 Tenth Edition
GCSE Computer Science – Logic Gates & Boolean Expressions
Logic Gates.
Chapter 4 Gates and Circuits.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Department of Electronics
Digital Fundamentals Floyd Chapter 5 Tenth Edition
XOR, XNOR, and Binary Adders
Combinational Logic Circuit
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Eng. Ahmed M Bader El-Din October, 2018
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Timing Analysis Section 2.4.2

Delay Time Def: Time required for output signal Y to change due to change in input signal X Up to now, we have assumed this delay time has been 0 seconds. t=0

Delay Time In a “real” circuit, it will take tp seconds for Y to change due to X t=0t=tp tp is known as the propagation delay time

Timing Diagram We use a timing diagram to graphically represent this delay Horizontal axis = time axis Vertical axis = Logical level axis (Logic One or Logic Zero)

Timing Diagram We see a change in X at t=0 causes a change in Y at t=tp Horizontal axis = time axis Vertical axis = Logical level axis (Logic One or Logic Zero)

Timing Diagram We also see a change in X at t=T causes another change in Y at t=T+tp We see that logic circuit F causes a delay of tp seconds in the signal

Simple Example – Not Gate Let tp=2 ns Where ns = nanosecond = 1x10 -9 seconds 2ns

Simple Example – 2 Not Gates Let tp=2 ns Total Delay = 2ns + 2ns = 4ns 2ns 4ns

Simple Example – 2 Not Gates Notes: Time axis is shared among signals Logic levels (1 or 0) are implied, not shown

Simple Example – 2 Not Gates Sometimes dashed vertical lines are added to aid reading diagram 2ns

Where does this delay come from? Circuit Delay

All electrical circuits have intrinsic resistance (R) and capacitance (C). Let’s analyze a simple RC circuit

Circuit Delay – Simple RC Circuit Vout Vin Note:

Circuit Delay – Example Vout Vin Let R=1ohm, C=1F, so that RC=1 second Time Delay is 0.7s or 700 ms for 0.5Vdd Time Delay is 2.3s for 0.9Vdd Time Delay is 4.6s for 0.99 Vdd

How do we relate this to logic diagrams?

Def: tplh tplh = low-to-high propagation delay time This is the time required for the output to rise from 0V to ½ VDD tplh

Def: tphl Tphl = high-to-low propagation delay time This is the time required for the output to fall from Vdd to ½ VDD tphl

Def: tp (propagation delay time) Let’s define tp = propagation delay time as This will be the “average” delay through the circuit

Gate Delay – Simple RC Model Ideal gate with RC network Equivalent model with Gate delay of tp_not Ideal gate with tp=0 delay RC network Tp=tp_not

Gate Delay - Example X 025ns 05ns30ns Y 5ns tp_not We indicate tp on the gate

Combinational Logic Delay Shortest delay Longest delay Longest delay = 20ns Shortest delay = 5ns This circuit has multiple delay paths A-Y = 5ns+5ns+5ns=15ns B-Y = 5ns+5ns+5ns+5ns=20ns C-Y = 5ns+5ns+5ns=15ns D-Y = 5ns

Combinational Logic Delay Shortest delay Longest delay Longest delay = 20ns We’ll use the longest delay to represent the logic function F. Let’s call it Tcl for time, combinational logic

Combinational Logic (CL) Cloud Model Tcl=20ns

Logic Simulators Used to simulate the output response of a logic circuit.

Logic Simulations Three primary types Circuit simulator (e.g. PSPICE)  “Exact” delay for each gate  Most accurate timing analysis  Very slow compared to other types Functional Simulation (e.g. Quartus )  Assumes one unit delay for each gate  Very fast compared to other types  Most inaccurate timing analysis Timing Simulation (e.g. Quartus)  Assumes “average” tp delay for each gate  Not the fastest or slowest timing analysis  Provides “pretty good” timing analysis

TPS Quizzes

Timing Quiz 1

Calculate all delay paths through the circuit shown below What is the shortest and longest delay?

Solution: Calculate all delay paths through the circuit shown below This circuit has multiple delay paths A-Y = 5ns+5ns+10ns=20ns B-Y = 2ns+5ns+5ns+10ns=22ns B-Y = 8ns+5ns+10ns=23ns C-Y = 8ns+5ns+10ns=23ns D-Y = 10ns Shortest path=10ns Longest path=23ns

Timing Quiz 2

Given the circuit below, find (a) Expression for the logic function (b) Longest delay in original circuit

Solution: Given the circuit below, find (a) Original logic function (b) Longest delay in original circuit Longest Delay = 7ns+7ns = 14ns

Timing Quiz 3

Given the circuit below, (a) Using Boolean Algebra, minimize the logic function (b) Longest delay in minimized circuit Delay times are NOT gates= 2ns; AND,OR gates= 5ns NAND, NOR gates= 7ns; XOR gates: 10ns XNOR gates: 12ns

Solution: Given the circuit below, find (a) Minimized logic function (b) Longest delay in minimized circuit Delay times are NOT gates= 2ns; AND,OR gates= 5ns NAND, NOR gates= 7ns; XOR gates: 10ns XNOR gates: 12ns You can show

Solution: Given the circuit below, find (a) Minimized logic function (b) Longest delay in minimized circuit Delay times are NOT gates= 2ns; AND,OR gates= 5ns NAND, NOR gates= 7ns; XOR gates: 10ns XNOR gates: 12ns Longest delay is 7ns

Solution Expanded

Given the circuit below, (a) Using a Truth Table and a K-map, minimize the logic function

Solution Do yourself!