give sequence to events have memory (short-term) use feedback from output to input to store information
|
|
- Magnus Elvin Wilkerson
- 6 years ago
- Views:
Transcription
1 Chapter 3 :: equential Logic esign Chapter 3 :: Topics igital esign and Computer Architecture avid Money Harris and arah L. Harris Introduction Latches and Flip-Flops ynchronous Logic esign Finite tate Machines Timing of equential Logic arallelism Copyright 27 Elsevier 3-<> Copyright 27 Elsevier 3-<2> Introduction Outputs of sequential logic depend on current and prior input values. equential logic thus has memory. ome definitions: tate: all the information about a circuit necessary to explain its future behavior Latches and flip-flops: state elements that store one bit of state ynchronous sequential circuits: combinational logic followed by a bank of flip-flops equential Circuits give sequence to events have memory (short-term) use feedback from output to input to store information Copyright 27 Elsevier 3-<3> Copyright 27 Elsevier 3-<4>
2 tate Elements Bistable Circuit The state of a circuit influences its future behavior tate elements store state Bistable circuit Latch Latch Flip-flop Fundamental building block of other state elements Two outputs:, No inputs I2 I I I2 Copyright 27 Elsevier 3-<5> Copyright 27 Elsevier 3-<6> Bistable Circuit Analysis Latch Consider the two possible cases: = : then = and = (consistent) I Latch N I2 = : then = and = (consistent) Bistable circuit stores bit of state in the state variable, (or ) But there are no inputs to control the state I I2 N2 Consider the four possible cases: =, = =, = =, = =, = Copyright 27 Elsevier 3-<7> Copyright 27 Elsevier 3-<8> 2
3 Latch Analysis Latch Analysis =, = : then = and = N =, = : then = prev prev = prev = N N N2 N2 N2 =, = : then = and = N =, = : then = and = N N2 Copyright 27 Elsevier 3-<9> N2 Copyright 27 Elsevier 3-<> Latch ymbol stands for et/eset Latch tores one bit of state () Control what value is being stored with, inputs et:make the output eset:make the output When the set input,, is (and = ), is set to When the reset input,, is (and = ), is reset to Invalid state when = = Latch ymbol Copyright 27 Elsevier 3-<3> Latch Two inputs:, : controls when the output changes (the data input): controls what the output changes to Function When =, passes through to (the latch is transparent) When =, holds its previous value (the latch is opaque) Avoids invalid case when NOT Latch ymbol Copyright 27 Elsevier 3-<4> 3
4 Latch Internal Circuit Flip-Flop X Copyright 27 Elsevier 3-<5> Two inputs:, Function The flip-flop samples on the rising edge of When rises from to, passes through to Otherwise, holds its previous value changes only on the rising edge of A flip-flop is called an edge-triggered device because it is activated on the clock edge Flip-Flop ymbols Copyright 27 Elsevier 3-<7> Flip-Flop Internal Circuit Flip-Flop vs. Latch Two back-to-back latches (L and L2) controlled by complementary clocks When = L is transparent L2 is opaque passes through to N When = L2 is transparent L is opaque N passes through to L N L2 Thus, on the edge of the clock (when rises from ) passes through to (latch) (flop) Copyright 27 Elsevier 3-<8> Copyright 27 Elsevier 3-<9> 4
5 egisters Enabled Flip-Flops 3: 4 4 3: Inputs:,, EN The enable input (EN) controls when new data () is stored Function EN = passes through to on the clock edge EN = the flip-flop retains its previous state EN Internal Circuit ymbol EN Copyright 27 Elsevier 3-<2> Copyright 27 Elsevier 3-<22> esettable Flip-Flops Inputs:,, eset Function: eset = is forced to eset = the flip-flop behaves like an ordinary flip-flop ymbols eset r esettable Flip-Flops Two types: ynchronous: resets at the clock edge only Asynchronous: resets immediately when eset = ynchronously resettable flip-flop requires changing the internal circuitry of the flip-flop (see Exercise 3.) Asynchronously resettable flip-flop: eset Internal Circuit Copyright 27 Elsevier 3-<23> Copyright 27 Elsevier 3-<24> 5
6 ettable Flip-Flops Inputs:,, et Funtion: et = is set to et = the flip-flop behaves like an ordinary flip-flop ymbols equential Logic equential circuits: all circuits that aren t combinational A problematic circuit: X Y Z This circuit has no inputs and -3 outputs X Y Z time (ns) et s Copyright 27 Elsevier 3-<25> Copyright 27 Elsevier 3-<26> ynchronous equential Logic esign Finite tate Machine (FM) Breaks cyclic paths by inserting registers These registers contain the state of the system The state changes at the clock edge, so we say the system is synchronized to the clock ules of synchronous sequential circuit composition: Every circuit element is either a register or a combinational circuit At least one circuit element is a register All registers receive the same clock signal Every cyclic path contains at least one register Two common synchronous sequential circuits Finite state machines (FMs) ipelines Consists of: tate register that tore the current state and Load the next state at the clock edge Combinational logic that Computes the next state Computes the outputs Next tate Next tate Logic C L Output Logic C L Current tate Next tate Outputs Copyright 27 Elsevier 3-<28> Copyright 27 Elsevier 3-<29> 6
7 Finite tate Machines (FMs) Finite tate Machine Example Next state is determined by the current state and the inputs Two types of finite state machines differ in the output logic: Moore FM: outputs depend only on the current state Mealy FM: outputs depend on the current state and the inputs M inputs M inputs next state logic next state logic Moore FM next k k state state Mealy FM next k state k state output logic output logic N outputs N outputs Copyright 27 Elsevier 3-<3> Traffic light controller Traffic sensors:, (TUE when there s traffic) Lights: L A, L B ining Hall Academic Labs L A Copyright 27 Elsevier 3-<3> Bravado Blvd. L B L A L B Fields Ave. orms FM Black Box FM tate Transition iagram Inputs:, eset,, Outputs: L A, L B Moore FM: outputs labeled in each state tates: Circles Transitions: Arcs eset L A : green L B : red TA L A : yellow L B : red Traffic Light Controller L A L B eset 3 L A : red L B : yellow 2 L A : red L B : green Copyright 27 Elsevier 3-<32> Copyright 27 Elsevier 3-<34> 7
8 FM tate Transition Table FM Encoded tate Transition Table Current tate X X X X Inputs X X X X Next tate ' Current tate Inputs X X X X X X X X Next tate ' ' tate 2 3 Encoding Copyright 27 Elsevier 3-<35> Copyright 27 Elsevier 3-<37> FM Output Table FM chematic: tate egister Current tate L A Outputs L A L B L B Output green yellow red Encoding ' ' r eset state register Copyright 27 Elsevier 3-<39> Copyright 27 Elsevier 3-<4> 8
9 FM chematic: Next tate Logic FM chematic: Output Logic L A ' ' L A ' r eset ' r eset L B L B inputs next state logic state register inputs next state logic state register output logic outputs Copyright 27 Elsevier 3-<42> Copyright 27 Elsevier 3-<43> FM Timing iagram FM tate Encoding eset ' : : L A: Cycle Cycle 2 Cycle 3 Cycle 4 Cycle 5 Cycle 6 Cycle 7 Cycle 8 Cycle 9 Cycle?? () () 2 () 3 () () ()?? () () 2 () 3 () ()?? Green () Yellow () ed () Green () Binary encoding: i.e., for four states,,,, One-hot encoding One state bit per state Only one state bit is HIGH at once I.e., for four states,,,, equires more flip-flops Often next state and output logic is simpler L B:?? ed () Green () Yellow () ed () T eset A TA L A : green L A : yellow L B : red L B : red t (sec) 3 2 Copyright 27 Elsevier L A : red L A : red 3-<44> L B : yellow L B : green Copyright 27 Elsevier 3-<45> 9
10 Moore vs. Mealy FM tate Transition iagrams Alyssa. Hacker has a snail that crawls down a paper tape with s and s on it. The snail smiles whenever the last four digits it has crawled over are. esign Moore and Mealy FMs of the snail s brain. reset Moore FM Mealy FM: arcs indicate input/output Mealy FM reset / / / / 2 3 Copyright 27 Elsevier 3-<46> / / / / Copyright 27 Elsevier 3-<47> Moore FM tate Transition Table Moore FM Output Table Current tate Inputs Next tate 2 A ' 2 ' ' tate Encoding Current tate Output Y Copyright 27 Elsevier 3-<48> Copyright 27 Elsevier 3-<5>
11 Mealy FM tate Transition and Output Table Moore FM chematic A Current tate Input Next tate Output ' 2 2 Y A ' ' Y tate Encoding ' 2 3 ' eset 2 Copyright 27 Elsevier 3-<52> Copyright 27 Elsevier 3-<54> Mealy FM chematic Moore and Mealy Timing iagram A Cycle Cycle 2 Cycle 3 Cycle 4 Cycle 5 Cycle 6 Cycle 7 Cycle 8 Cycle 9 Cycle ' Y eset ' eset A Y Y Moore Machine?? Mealy Machine?? Copyright 27 Elsevier 3-<55> Copyright 27 Elsevier 3-<56>
12 Factoring tate Machines arade FM Break complex FMs into smaller interacting FMs Example: Modify the traffic light controller to have a arade Mode. The FM receives two more inputs:, When =, it enters arade Mode and the Bravado Blvd. light stays green. When =, it leaves arade Mode Unfactored FM Factored FM Controller FM Mode FM M L A L B Lights FM L A L B Controller FM Copyright 27 Elsevier 3-<57> Copyright 27 Elsevier 3-<58> Unfactored FM tate Transition iagram Factored FM tate Transition iagram eset L A : green L B : red 3 L A : red L B : yellow L A : yellow L B : red 2 L A : red L B : green 4 L A : green L B : red 7 L A : red L B : yellow 5 L A : yellow L B : red 6 L A : red L B : green eset L A : green L B : red 3 L A : red L B : yellow TA M L A : yellow L B : red 2 L A : red L B : green eset M: M: M + Lights FM Mode FM Copyright 27 Elsevier 3-<59> Copyright 27 Elsevier 3-<6> 2
13 FM esign rocedure Timing Identify the inputs and outputs ketch a state transition diagram Write a state transition table elect state encodings For a Moore machine: ewrite the state transition table with the selected state encodings Write the output table For a Mealy machine: ewrite the combined state transition and output table with the selected state encodings Write Boolean equations for the next state and output logic ketch the circuit schematic Flip-flop samples at clock edge must be stable when it is sampled imilar to a photograph, must be stable around the clock edge If is changing when it is sampled, metastability can occur Copyright 27 Elsevier 3-<6> Copyright 27 Elsevier 3-<62> Input Timing Constraints etup time: t setup = time before the clock edge that data must be stable (i.e. not changing) Hold time: t hold = time after the clock edge that data must be stable Aperture time: t a = time around clock edge that data must be stable (t a = t setup + t hold ) Output Timing Constraints ropagation delay: t pcq = time after clock edge that the output is guaranteed to be stable (i.e., to stop changing) Contamination delay: t ccq = time after clock edge that might be unstable (i.e., start changing) t ccq t pcq t setup t hold t Copyright 27 Elsevier a 3-<63> Copyright 27 Elsevier 3-<64> 3
14 ynamic iscipline The input to a synchronous sequential circuit must be stable during the aperture (setup and hold) time around the clock edge. pecifically, the input must be stable at least t setup before the clock edge at least until t hold after the clock edge ynamic iscipline The delay between registers has a minimum and maximum delay, dependent on the delays of the circuit elements (a) CL 2 2 T c 2 (b) Copyright 27 Elsevier 3-<65> Copyright 27 Elsevier 3-<66> etup Time Constraint Hold Time Constraint The setup time constraint depends on the maximum delay from register through the combinational logic. The input to register 2 must be stable at least t setup before the clock edge. 2 C L T c t pcq t pd t setup 2 2 T c The hold time constraint depends on the minimum delay from register through the combinational logic. The input to register 2 must be stable for at least t hold after the clock edge. C 2 L 2 2 t ccq t cd t hold t hold < Copyright 27 Elsevier 3-<67> Copyright 27 Elsevier 3-<7> 4
15 Timing Analysis Fixing Hold Time Violation A B C X' X Timing Characteristics t ccq = 3 ps t pcq = 5 ps t setup = 6 ps t hold = 7 ps Add buffers to the short paths: A B C X' X Timing Characteristics t ccq = 3 ps t pcq = 5 ps t setup = 6 ps t hold = 7 ps t pd = Y' Y per gate t pd = 35 ps t cd = 25 ps t pd = Y' Y per gate t pd = 35 ps t cd = 25 ps t cd = t cd = etup time constraint: Hold time constraint: etup time constraint: Hold time constraint: T c f c = /T c = t ccq + t pd > t hold? T c f c = t ccq + t pd > t hold? Copyright 27 Elsevier 3-<73> Copyright 27 Elsevier 3-<75> Clock kew etup Time Constraint with Clock kew The clock doesn t arrive at all registers at the same time This may be caused by delay or other timing noise kew is the difference between two clock edges Because there may be many registers in a system, we examine the worst case for each case to guarantee that the dynamic discipline is not violated for any register t skew delay C L In the worst case, the 2 is earlier than C 2 L T c 2 T c 2 t pcq t pd t setup t skew Copyright 27 Elsevier 3-<77> Copyright 27 Elsevier 3-<78> 5
16 Hold Time Constraint with Clock kew Violating the ynamic iscipline In the worst case, 2 is later than 2 2 CL Asynchronous (for example, user) inputs might violate the dynamic discipline t setup t hold 2 2 t ccq t cd 2 t ccq + t cd > t cd > button t aperture Case I Case II t skew t hold Copyright 27 Elsevier 3-<8> Copyright 27 Elsevier 3-<84>??? Case III Metastability Flip-flop Internals Any bistable device has two stable states and a metastable state between them A flip-flop has two stable states ( and ) and one metastable state If a flip-flop lands in the metastable state, it could stay there for an undetermined amount of time Because the flip-flop has feedback, if is somewhere between and, the cross-coupled gates will eventually drive the output to either rail ( or, depending on which one it is closer to). N metastable N2 stable stable A signal is considered metastable if it hasn t resolved to or If a flip-flop input changes at a random time, the probability that the output is metastable after waiting some time, t, is: (t res > t) = (T /T c ) e -t/τ Copyright 27 Elsevier 3-<85> t res : time to resolve to or T, τ : properties of the circuit Copyright 27 Elsevier 3-<86> 6
17 Metastability Intuitively: T /T c describes the probability that the input changes at a bad time, i.e., during the aperture time (t res > t) = (T /T c ) e -t/τ τ is a time constant indicating how fast the flip-flop moves away from the metastable state; it is related to the delay through the cross-coupled gates in the flip-flop (t res > t) = (T /T c ) e -t/τ ynchronizers Asynchronous inputs () are inevitable (user interfaces, systems with different clocks interacting, etc.). The goal of a synchronizer is to make the probability of failure (the output still being metastable) low. A synchronizer cannot make the probability of failure. In short, if a flip-flop samples a metastable input, if you wait long enough (t), the output will have resolved to or with high probability. YNC Copyright 27 Elsevier 3-<87> Copyright 27 Elsevier 3-<88> ynchronizer Internals ynchronizer robability of Failure A synchronizer can be built with two back-to-back flip-flops. uppose the input is transitioning when it is sampled by flip-flop, F. The amount of time the internal signal 2 can resolve to a or is (T c - t setup ). F 2 T c F2 For each sample, the probability of failure of this synchronizer is: (failure) = (T /T c ) e -(T c - t setup )/τ F 2 T c F2 2 metastable 2 metastable Copyright 27 Elsevier t t 3-<89> res setup t pcq Copyright 27 Elsevier t t 3-<9> res setup t pcq 7
18 ynchronizer Mean Time Before Failure If the asynchronous input changes once per second, the probability of failure per second of the synchronizer is simply (failure): In general, if the input changes N times per second, the probability of failure per second of the synchronizer is: (failure)/second = (NT /T c ) e -(T c - t setup )/τ Thus, the synchronizer fails, on average, /[(failure)/second] This is called the mean time between failures, MTBF: MTBF = /[(failure)/second] = (T c /NT ) e (T c - t setup )/τ Example ynchronizer F 2 uppose: T c = /5 MHz τ = 2 ps T = 5 ps t setup = ps N = events per second What is the probability of failure? MTBF? (failure) = (failure)/second = F2 MTBF = Copyright 27 Elsevier 3-<9> Copyright 27 Elsevier 3-<92> arallelism arallelism Example ome definitions: Token: A group of inputs processed to produce a group of outputs Latency: Time for one token to pass from start to end Throughput: The number of tokens that can be produced per unit time arallelism increases throughput. Two types of parallelism: patial parallelism duplicate hardware performs multiple tasks at once Temporal parallelism task is broken into multiple stages also called pipelining for example, an assembly line Ben Bitdiddle is baking cookies to celebrate the installation of his traffic light controller. It takes 5 minutes to roll the cookies and 5 minutes to bake them. After finishing one batch he immediately starts the next batch. What is the latency and throughput if Ben doesn t use parallelism? Latency = = 2 minutes = /3 hour Throughput = tray/ /3 hour = 3 trays/hour Copyright 27 Elsevier 3-<94> Copyright 27 Elsevier 3-<96> 8
19 arallelism Example patial arallelism What is the latency and throughput if Ben uses parallelism? patial parallelism: Ben asks Allysa. Hacker to help, using her own oven Temporal parallelism: Ben breaks the task into two stages: roll and baking. He uses two trays. While the first batch is baking he rolls the second batch, and so on. patial arallelism Tray Tray 2 Tray 3 Tray 4 Latency: time to first tray Time Ben Ben oll Alyssa Alyssa Ben 2 Ben 2 Bake Alyssa 2 Alyssa 2 Legend Latency = Throughput = Copyright 27 Elsevier 3-<97> Copyright 27 Elsevier 3-<98> Temporal arallelism Latency: time to first tray Temporal arallelism Tray Tray 2 Tray 3 Ben Ben Ben 2 Ben 2 Ben 3 Ben 3 Time Latency = Throughput = Copyright 27 Elsevier 3-<> 9
Digital Logic & Computer Design CS Professor Dan Moldovan Spring Chapter 3 :: Sequential Logic Design
igital Logic & Computer esign CS 4341 Professor an Moldovan Spring 21 Copyright 27 Elsevier 3- Chapter 3 :: Sequential Logic esign igital esign and Computer Architecture avid Money Harris and Sarah
More informationGive sequence to events Have memory y( (short-term) Use feedback from output to input to store information
Chapter 3 :: equential Logi esign igital esign and Computer Arhiteture avid Money Harris and arah L. Harris Chapter 3 :: Topis Introdution Lathes and Flip-Flops ynhronous Logi esign Finite tate Mahines
More informationENGR 303 Introduction to Logic Design Lecture 10. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
ENG 33 Introduction to Logic esign Lecture r. Chuck Brown Engineering and Computer Information cience Folsom Lake College Outline for Todays Lecture equential Circuits Latches egisters Flip-Flops ENG 33
More informationExercises. 162 CHAPTER THREE Sequential Logic Design
162 CHPTE THEE equential Logic Design Exercises Exercise 3.1 Given the input waveforms shown in Figure 3.61, sketch the output,, of an latch. Figure 3.61 Input waveforms of latch for Exercise 3.1 Exercise
More informationECEN454 Digital Integrated Circuit Design. Sequential Circuits. Sequencing. Output depends on current inputs
ECEN454 igital Integrated Circuit esign Sequential Circuits ECEN 454 Combinational logic Sequencing Output depends on current inputs Sequential logic Output depends on current and previous inputs Requires
More informationMore on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98
More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 98 Review: Bit Storage SR latch S (set) Q R (reset) Level-sensitive SR latch S S1 C R R1 Q D C S R D latch Q
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Fall 2012 State-Holding Elements Bistable Elements Equivalent circuits; right is more traditional. Two stable states:
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Summer 2016 State-Holding Elements Bistable Elements S Latch Latch Positive-Edge-Triggered Flip-Flop Flip-Flop with
More informationBasis of sequential circuits: the R-S latch
equential logic Asynchronous sequential logic state changes occur whenever state inputs change (elements may be simple wires or delay elements) ynchronous sequential logic state changes occur in lock step
More informationFundamentals of Computer Systems
Fundamentals of omputer Systems Sequential Logic Martha A. Kim olumbia University Spring 2016 1/1 2/1 Bistable Elements Equivalent circuits; right is more traditional. Two stable states: 0 1 1 0 3/1 S
More information6. Sequential Logic Flip-Flops
ection 6. equential Logic Flip-Flops Page of 5 6. equential Logic Flip-Flops ombinatorial components: their output values are computed entirely from their present input values. equential components: their
More informationLecture 11: Sequential Circuit Design
Lecture 11: Sequential Circuit esign Outline q Sequencing q Sequencing Element esign q Max and Min-elay q Clock Skew q Time Borrowing q Two-Phase Clocking 2 Sequencing q Combinational logic output depends
More informationcascading flip-flops for proper operation clock skew Hardware description languages and sequential logic
equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops Timing methodologies cascading flip-flops for proper operation clock skew Basic registers shift registers
More informationCPE/EE 427, CPE 527 VLSI Design I Sequential Circuits. Sequencing
CPE/EE 427, CPE 527 VLSI esign I Sequential Circuits epartment of Electrical and Computer Engineering University of Alabama in Huntsville Aleksandar Milenkovic ( www.ece.uah.edu/~milenka ) Combinational
More information! Two inverters form a static memory cell " Will hold value as long as it has power applied
equential Logic! equential Circuits " imple circuits with feedback " Latches " Edge-triggered flip-flops! Timing Methodologies " Cascading flip-flops for proper operation " Clock skew! Basic egisters "
More informationSequential Logic. Sequential Circuits. ! Timing Methodologies " Cascading flip-flops for proper operation " Clock skew
equential Logic! equential Circuits " imple circuits with feedback " Latches " Edge-triggered flip-flops! Timing Methodologies " Cascading flip-flops for proper operation " Clock skew! Basic egisters "
More information11. Sequential Elements
11. Sequential Elements Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 11, 2017 ECE Department, University of Texas at Austin
More informationSequential Circuits. Sequential Logic. Circuits with Feedback. Simplest Circuits with Feedback. Memory with Cross-coupled Gates.
equential Logic equential Circuits equential Circuits imple circuits with feedback Latches Edge-triggered flip-flops Timing Methodologies Cascading flip-flops for proper operation Clock skew Basic egisters
More informationALGORITHMS IN HW EECS150 ALGORITHMS IN HW. COMBINATIONAL vs. SEQUENTIAL. Sequential Circuits ALGORITHMS IN HW
LGOITHM HW EEC150 ection 2 Introduction to equential Logic Fall 2001 pproach #2: Combinational divide & conquer a[0] a[1] a[1022] a[1023] MX MX MX 512 + 256 + K+ 1 = 1023 blocks Each MX block has: 64 s;
More informationTraversing Digital Design. EECS Components and Design Techniques for Digital Systems. Lec 22 Sequential Logic - Advanced
Traversing igital esign EEC 5 - Components and esign Techniques for igital ystems EEC5 wks 6-5 Lec 22 equential Logic - Advanced avid Culler Electrical Engineering and Computer ciences University of California,
More informationLogic Design ( Part 3) Sequential Logic (Chapter 3)
o Far: Combinational Logic Logic esign ( Part ) equential Logic (Chapter ) Based on slides McGraw-Hill Additional material 24/25/26 Lewis/Martin Additional material 28 oth Additional material 2 Taylor
More informationSwitching Circuits & Logic Design
witching Circuits & Logic esign Jie-Hong oland Jiang 江介宏 epartment of Electrical Engineering National Taiwan University Fall 24 Latches and Flip-Flops http://www3.niaid.nih.gov/topics/malaria/lifecycle.htm
More informationChapter 6. Flip-Flops and Simple Flip-Flop Applications
Chapter 6 Flip-Flops and Simple Flip-Flop Applications Basic bistable element It is a circuit having two stable conditions (states). It can be used to store binary symbols. J. C. Huang, 2004 Digital Logic
More informationCOSC 243. Sequential Logic. COSC 243 (Computer Architecture) Lecture 5 - Sequential Logic 1
COC 243 equential Logic COC 243 (Computer Architecture) Lecture 5 - equential Logic 1 Overview Last Lecture This Lecture equential logic circuits ource: Chapter 11 (10 th edition) Next Lecture Computer
More informationSequential logic. Circuits with feedback. How to control feedback? Sequential circuits. Timing methodologies. Basic registers
equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops Timing methodologies cascading flip-flops for proper operation clock skew Basic registers shift registers
More informationSequential Circuits. Introduction to Digital Logic. Course Outline. Overview. Introduction to Digital Logic. Introduction to Sequential Circuits
Introduction to igital Logic Prof. Nizamettin IN naydin@yildiz.edu.tr naydin@ieee.org ourse Outline. igital omputers, Number ystems, rithmetic Operations, ecimal, lphanumeric, and Gray odes 2. inary Logic,
More informationUNIT 11 LATCHES AND FLIP-FLOPS
UNIT 11 LATCHE AN FLIP-FLOP pring 2011 Latches and Flip-Flops 2 Contents et-eset latch Gated latch Edge-triggered flip-flop - flip-flop J-K flip-flop T flip-flop Flip-flops with additional inputs eading
More informationLecture 8: Sequential Logic
Lecture 8: Sequential Logic Last lecture discussed how we can use digital electronics to do combinatorial logic we designed circuits that gave an immediate output when presented with a given set of inputs
More informationEngr354: Digital Logic Circuits
Engr354: igital Circuits Chapter 7 Sequential Elements r. Curtis Nelson Sequential Elements In this chapter you will learn about: circuits that can store information; Basic cells, latches, and flip-flops;
More informationLecture 7: Sequential Networks
Lecture 7: Sequential Networks CSE 14: Components and Design Techniques for Digital Systems Spring 214 CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego
More informationSequential Circuit Design: Part 1
Sequential Circuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking Clocked inverters James Morizio 1 Sequential Logic FFs
More informationLecture 10: Sequential Circuits
Introduction to CMOS VLSI esign Lecture 10: Sequential Circuits avid Harris Harvey Mudd College Spring 2004 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationComputer Organization and Components
2 Course tructure Computer Organization and Components odule 4: emory Hierarchy odule : esign I5, fall 24 Lecture 2: equential esign F C Ö F2 C Ö2 F7b Lab: dicom F odule 2: C and ssembly Programming ssociate
More informationSequential Circuit Design: Part 1
Sequential ircuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking locked inverters Krish hakrabarty 1 Sequential Logic FFs
More informationChapter 7 Sequential Circuits
Chapter 7 Sequential Circuits Jin-Fu Li Advanced Reliable Systems (ARES) Lab. epartment of Electrical Engineering National Central University Jungli, Taiwan Outline Latches & Registers Sequencing Timing
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:
More informationEE 447/547 VLSI Design. Lecture 9: Sequential Circuits. VLSI Design EE 447/547 Sequential circuits 1
EE 447/547 VLSI esign Lecture 9: Sequential Circuits Sequential circuits 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time Borrowing Two-Phase Clocking Sequential
More informationOverview of Chapter 4
Overview of hapter 4 Types of equential ircuits torage Elements Latches Flip-Flops equential ircuit nalysis tate Tables tate iagrams equential ircuit esign pecification ssignment of tate odes Implementation
More informationProblems with D-Latch
Problems with -Latch If changes while is true, the new value of will appear at the output. The latch is transparent. If the stored value can change state more than once during a single clock pulse, the
More informationLATCHES & FLIP-FLOP. Chapter 7
LATCHES & FLIP-FLOP Chapter 7 INTRODUCTION Latch and flip flops are categorized as bistable devices which have two stable states,called SET and RESET. They can retain either of this states indefinitely
More informationPage 1. Some Definitions. Chapter 3: Sequential Logic. Sequential Logic. The Combinational Logic Unit. A NOR Gate with a Lumped Delay
3- hapter 3 equential Logic hapter 3: equential Logic 3-2 hapter 3 equential Logic ome efinitions r. Tim McGuire am Houston tate University ased on notes by Miles Murdocca ombinational logic: a digital
More informationSequencing. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall,
Sequencing ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2013 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Introduction Sequencing
More informationEECS150 - Digital Design Lecture 19 - Finite State Machines Revisited
EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited April 2, 2013 John Wawrzynek Spring 2013 EECS150 - Lec19-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
More information(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement
Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 7 (07 Feb 2008) 1 Announcement 2 1 Combinational vs. Sequential Logic Combinational Logic Memoryless Outputs
More informationSynchronous Sequential Logic
Synchronous Sequential Logic -A Sequential Circuit consists of a combinational circuit to which storage elements are connected to form a feedback path. The storage elements are devices capable of storing
More information12/31/2010. Overview. 12-Latches and Flip Flops Text: Unit 11. Sequential Circuits. Sequential Circuits. Feedback. Feedback
2/3/2 Overview 2-atches and Flip Flops Text: Unit equential Circuits et/eset atch Flip-Flops ECEG/IC 2 igital Operations and Computations Winter 2 r. ouie 2 equential Circuits equential circuits: Output
More informationECE 25 Introduction to Digital Design. Chapter 5 Sequential Circuits ( ) Part 1 Storage Elements and Sequential Circuit Analysis
EE 25 Introduction to igital esign hapter 5 Sequential ircuits (5.1-5.4) Part 1 Storage Elements and Sequential ircuit Analysis Logic and omputer esign Fundamentals harles Kime & Thomas Kaminski 2008 Pearson
More informationAdministrative issues. Sequential logic
Administrative issues Midterm #1 will be given Tuesday, October 29, at 9:30am. The entire class period (75 minutes) will be used. Open book, open notes. DDPP sections: 2.1 2.6, 2.10 2.13, 3.1 3.4, 3.7,
More informationDigital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic
Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationCombinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationCSE115: Digital Design Lecture 23: Latches & Flip-Flops
Faculty of Engineering CSE115: Digital Design Lecture 23: Latches & Flip-Flops Sections 7.1-7.2 Suggested Reading A Generic Digital Processor Building Blocks for Digital Architectures INPUT - OUTPUT Interconnect:
More informationFigure 1 shows a simple implementation of a clock switch, using an AND-OR type multiplexer logic.
1. CLOCK MUXING: With more and more multi-frequency clocks being used in today's chips, especially in the communications field, it is often necessary to switch the source of a clock line while the chip
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
More informationChapter 6 Sequential Circuits
Overview Logic and omputer esign Fundamentals hapter 6 equential ircuits Part torage Elements and equential ircuit nalysis pring 4 Part - torage Elements and nalysis Introduction to sequential circuits
More informationLogic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)
Logic esign ( Part ) Sequential Logic- Finite State Machines (Chapter ) Based on slides McGraw-Hill Additional material 00/00/006 Lewis/Martin Additional material 008 Roth Additional material 00 Taylor
More informationObjectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
More informationCombinational / Sequential Logic
Digital Circuit Design and Language Combinational / Sequential Logic Chang, Ik Joon Kyunghee University Combinational Logic + The outputs are determined by the present inputs + Consist of input/output
More informationCS8803: Advanced Digital Design for Embedded Hardware
Copyright 2, 23 M Ciletti 75 STORAGE ELEMENTS: R-S LATCH CS883: Advanced igital esign for Embedded Hardware Storage elements are used to store information in a binary format (e.g. state, data, address,
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationLogic and Computer Design Fundamentals. Chapter 7. Registers and Counters
Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state
More informationSequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1
Sequential Logic E&CE 223 igital Circuits and Systems (A. Kennings) Page 1 Sequential Circuits Have considered only combinational circuits in which circuit outputs are determined entirely by current circuit
More informationCounters. The simplest circuit for binary counting is a multibit divider.
Counters The simplest circuit for binary counting is a multibit divider. +5 CL 0 1 2 3 Each bit toggles on the downward edge of the preceding bit. The timing is asynchronous. This particular circuit is
More informationEECS150 - Digital Design Lecture 15 Finite State Machines. Announcements
EECS150 - Digital Design Lecture 15 Finite State Machines October 18, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://www-inst.eecs.berkeley.edu/~cs150
More informationThe outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both).
1 The outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both). The value that is stored in a flip-flop when the clock pulse occurs
More informationSlide Set 7. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 7 for ENEL 353 Fall 216 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 216 SN s ENEL 353 Fall 216 Slide Set 7 slide
More information2 Sequential Circuits
2 2.1 State Diagrams and General Form 0/0 1/0 Start State 0 /0 1/1 State 1 /1 0/1 State Diagram of a Change Detector ( Mealy-machine). The output Y assumes 1 whenever the input X has changed. Otherwise
More informationSoftware Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits
Software Engineering 2DA4 Slides 9: Asynchronous Sequential Circuits Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of
More informationChapter 6. sequential logic design. This is the beginning of the second part of this course, sequential logic.
Chapter 6. sequential logic design This is the beginning of the second part of this course, sequential logic. equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops
More informationMemory elements. Topics. Memory element terminology. Variations in memory elements. Clock terminology. Memory element parameters. clock.
Topics! Memory elements.! Basics of sequential machines. Memory elements! Stores a value as controlled by clock.! May have load signal, etc.! In CMOS, memory is created by:! capacitance (dynamic);! feedback
More informationP U Q Q*
ECE 27 Learning Outcome 3 - - Practice Exam A LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each question.
More information6.S084 Tutorial Problems L05 Sequential Circuits
Preamble: Sequential Logic Timing 6.S084 Tutorial Problems L05 Sequential Circuits In Lecture 5 we saw that for D flip-flops to work correctly, the flip-flop s input should be stable around the rising
More informationWe are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors
CSC258 Week 5 1 We are here Assembly Language Processors Arithmetic Logic Units Devices Finite State Machines Flip-flops Circuits Gates Transistors 2 Circuits using flip-flops Now that we know about flip-flops
More informationMomentary Changes in Outputs. State Machine Signaling. Oscillatory Behavior. Hazards/Glitches. Types of Hazards. Static Hazards
State Machine Signaling Momentary hanges in Outputs Timing ehavior Glitches/hazards and how to avoid them SM Partitioning What to do when the state machine doesn t fit! State Machine Signaling State Machine
More informationFlip-Flops and Sequential Circuit Design
Flip-Flops and Sequential Circuit Design ECE 52 Summer 29 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6
More informationDigital Circuit And Logic Design I. Lecture 8
Digital Circuit And Logic Design I Lecture 8 Outline Sequential Logic Design Principles (1) 1. Introduction 2. Latch and Flip-flops 3. Clocked Synchronous State-Machine Analysis Panupong Sornkhom, 2005/2
More informationDigital Circuit And Logic Design I
Digital Circuit And Logic Design I Lecture 8 Outline Sequential Logic Design Principles (1) 1. Introduction 2. Latch and Flip-flops 3. Clocked Synchronous State-Machine Panupong Sornkhom, 2005/2 2 1 Sequential
More informationEE 121 June 4, 2002 Digital Design Laboratory Handout #34 CLK
EE 2 June 4, 22 igital esign Laboratory Handout #34 Midterm Examination #2 Solutions Open book, open notes. Time limit: 75 minutes. (2 points) Setup and hold times. The flip-flops below have setup time
More informationNote that none of the above MAY be a VALID ANSWER.
ECE 27 Learning Outcome 3 - - Practice Exam / Solution LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each
More informationChapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays. Introduction to latches Chapter 9: Binary Arithmetic
12.12.216 Chapter 5 Flip Flops Dr.-ng. Stefan Werner /14 Table of content Chapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays Chapter 3: Karnaugh-Veitch-Maps Chapter 4: Combinational
More informationFinal Exam review: chapter 4 and 5. Supplement 3 and 4
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationChapter 4. Logic Design
Chapter 4 Logic Design 4.1 Introduction. In previous Chapter we studied gates and combinational circuits, which made by gates (AND, OR, NOT etc.). That can be represented by circuit diagram, truth table
More informationINTEGRATED CIRCUITS. AN219 A metastability primer Nov 15
INTEGRATED CIRCUITS 1989 Nov 15 INTRODUCTION When using a latch or flip-flop in normal circumstances (i.e., when the device s setup and hold times are not being violated), the outputs will respond to a
More informationChapter 6. sequential logic design. This is the beginning of the second part of this course, sequential logic.
Chapter 6. sequential logic design This is the beginning of the second part of this course, sequential logic. 1 equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops
More informationP U Q Q*
ECE 27 Learning Outcome 3 - - Practice Exam / Solution LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each
More informationLec 24 Sequential Logic Revisited Sequential Circuit Design and Timing
Traversing igital esign EECS - Components and esign Techniques for igital Systems EECS wks 6 - Lec 24 Sequential Logic Revisited Sequential Circuit esign and Timing avid Culler Electrical Engineering and
More informationPrinciples of Computer Architecture. Appendix A: Digital Logic
A-1 Appendix A - Digital Logic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationDigital Fundamentals
igital Fundamentals Tenth Edition Floyd Chapter 7 Modified by Yuttapong Jiraraksopakun Floyd, igital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Summary Latches A latch is a temporary
More informationEITF35: Introduction to Structured VLSI Design
EITF35: Introduction to Structured VLSI Design Part 4.2.1: Learn More Liang Liu liang.liu@eit.lth.se 1 Outline Crossing clock domain Reset, synchronous or asynchronous? 2 Why two DFFs? 3 Crossing clock
More informationSequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)
Sequential Circuits Combinational circuits Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs) Sequential circuits Combination circuits with memory
More informationChapter 5 Sequential Circuits
Logic and omputer Design Fundamentals hapter 5 Sequential ircuits Part 1 Storage Elements and Sequential ircuit Analysis harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More information1. Convert the decimal number to binary, octal, and hexadecimal.
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
More informationSequential Logic Circuits
Sequential Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch- Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has memory
More informationUNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram
UNIT III INTRODUCTION In combinational logic circuits, the outputs at any instant of time depend only on the input signals present at that time. For a change in input, the output occurs immediately. Combinational
More informationUnit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1
Unit 9 Latches and Flip-Flops Dept. of Electrical and Computer Eng., NCTU 1 9.1 Introduction Dept. of Electrical and Computer Eng., NCTU 2 What is the characteristic of sequential circuits in contrast
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationGlitches/hazards and how to avoid them. What to do when the state machine doesn t fit!
State Machine Signaling Timing Behavior Glitches/hazards and how to avoid them SM Partitioning What to do when the state machine doesn t fit! State Machine Signaling Introducing Idle States (synchronous
More informationCprE 281: Digital Logic
CprE 281: igital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Registers CprE 281: igital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationLatches, Flip-Flops, and Registers. Dr. Ouiem Bchir
Latches, Flip-Flops, and Registers (Chapter #7) Dr. Ouiem Bchir The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney. Sequential
More information