CEC 220 Digital Circuit Design Timing Analysis of State Machines

Slides:



Advertisements
Similar presentations
Tutorial 2 Sequential Logic. Registers A register is basically a D Flip-Flop A D Flip Flop has 3 basic ports. D, Q, and Clock.
Advertisements

Lecture #24 Page 1 EE 367 – Logic Design Lecture #24 Agenda 1.State Machines Review Announcements 1.n/a.
Sequential Circuits Storage elements
State-machine structure (Mealy)
Analysis of Clocked Sequential Circuits
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
Nonlinear & Neural Networks LAB. CHAPTER 13 Analysis of Clocked Sequential Circuit 13.1 A Sequential Parity Checker 13.2 Analysis by Signal Tracing 13.3.
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Sequential Circuit Design
ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.
ECE 331 – Digital System Design State Reduction and State Assignment (Lecture #22) The slides included herein were taken from the materials accompanying.
ECE 331 – Digital System Design
6/12/20151 Sequence Detectors Lecture Notes – Lab 4 Sequence detection is the act of recognizing a predefined series of inputs A sequence detector is a.
ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Give qualifications of instructors: DAP
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.
Sequential Circuit Design
Digital Logic Design Lecture 26. Announcements Exams will be returned on Thursday Final small quiz on Monday, 12/8. Final homework will be assigned Thursday,
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
1 Synchronous Sequential Circuit Analysis. 2 Synchronous Sequential Circuit State Memory – A set of n edge-triggered flip-flops that store the current.
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 4 – Part 3 Tom Kaminski & Charles.
Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
T Flip-Flop A T (toggle) flip-flop is a complementing flip-flop and can be obtained from a JK flip-flop when the two inputs are tied together. When T =
1 COMP541 State Machines Montek Singh Feb 8, 2012.
Circuit, State Diagram, State Table
State Machines.
ECE2030 Introduction to Computer Engineering Lecture 16: Finite State Machines Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
Sequential Logic Materials taken from: Digital Design and Computer Architecture by David and Sarah Harris & The Essentials of Computer Organization and.
Lecture 18 More Moore/Mealy machines.
Introduction to Sequential Logic Design Finite State-Machine Design.
Counters Dr. Rebhi S. Baraka Logic Design (CSCI 2301) Department of Computer Science Faculty of Information Technology The Islamic University.
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Synchronous Counters Synchronous digital counters have a common clock which results in all the flip-flops being triggered simultaneously. Consequently,
Digital Logic Design Lecture # 19 University of Tehran.
DLD Lecture 26 Finite State Machine Design Procedure.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Sequential Circuit: Analysis BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
Registers; State Machines Analysis Section 7-1 Section 5-4.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
CEC 220 Digital Circuit Design Latches and Flip-Flops Monday, March 03 CEC 220 Digital Circuit Design Slide 1 of 19.
CEC 220 Digital Circuit Design VHDL in Sequential Logic Wednesday, March 25 CEC 220 Digital Circuit Design Slide 1 of 13.
CEC 220 Digital Circuit Design Counters Using S-R and J-K Flip-Flops Monday, November 2 CEC 220 Digital Circuit Design Slide 1 of 19.
CEC 220 Digital Circuit Design Sequence Detector Design Wednesday, April 01 CEC 220 Digital Circuit Design Slide 1 of 11.
CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
Sichuan University Software College
Introduction ELEC 418 Advanced Digital Systems Dr. Ron Hayne Images Courtesy of Thomson Engineering.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Introduction to Sequential Logic Design Finite State-Machine Analysis.
CEC 220 Digital Circuit Design Latches and Flip-Flops
CEC 220 Digital Circuit Design State Machine Charts Friday, April 11 CEC 220 Digital Circuit Design Slide 1 of 13.
State Machine Design State Machine Design Digital Electronics
Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.
Lecture 4. Sequential Logic #2
Introduction to Sequential Logic Design
Analysis of Clocked Sequential Circuit
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
ECE 301 – Digital Electronics
332:437 Lecture 12 Finite State Machine Design
SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.
Presentation transcript:

CEC 220 Digital Circuit Design Timing Analysis of State Machines Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Lecture Outline Analysis from Timing Diagrams Analysis from sequential circuits Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 1. Reverse Engineering from a Timing Diagram Given the timing diagram for a clocked sequential circuit (i.e., “state machine”) determine the state transition graph Clock Input Output State FFA FFB How many Flip-Flops? Rising or falling edge triggered? Moore or Mealy machine? Monday, November 9 CEC 220 Digital Circuit Design

Timing Analysis of State Machines 1 Timing Analysis of State Machines 1. Reverse Engineering from a Timing Diagram Clock Input Output State FFA FFB 1 1 1 1 x=0 falling edge triggered S1 Z=0 x=1 S0 Z=0 x=1 x=0 Moore Machine S2 Z=1 x=1 x=1 x=0 S3 Z=0 x=0 Is the state machine completely defined? Let’s assume that S2  S3 if x=0. Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 1. Reverse Engineering from a Timing Diagram Develop the State Transition Table Present State Next State Present Output (Z) x=0 x=1 S0 S1 S2 S3 S0 S1 S3 S1 S3 S1 1 S0 S2 Present State Next State Present Output (Z) w=0 w=1 00 01 11 10 1 State Encoding QAQB S0 = 00 S1 = 01 S2 = 10 S3 = 11 Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 2. Reverse Engineering from a Circuit Given the sequential circuit determine the state transition table & graph x 𝐷 𝐴 𝑄 𝐴 𝑄 𝐴 Z 𝐷 𝐵 𝑄 𝐵 𝑄 𝐵 How many states? Moore or Mealy machine? Clk Input Logic Flip-Flops Output Logic Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 2. Reverse Engineering from a Circuit Develop the State Transition Table Could use the FF Excitation Eqns And go directly to Next State Cols!! Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 X=1 DA DB 00 0 0 0 1 01 1 1 10 1 11 1 0 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 X=1 DA DB 00 01 10 11 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 X=1 DA DB 00 01 10 1 11 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 X=1 DA DB 00 01 0 0 0 1 11 1 1 10 1 1 0 Moore Machine Four States Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 2. Reverse Engineering from a Circuit Develop the state transition graph x=0 x=1 S00 Z=0 S01 S11 S10 Z=1 x=1 x=0 x=1 x=0 x=1 x=0 Compare this graph with the one obtained from the prior waveform example. Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 3. Reverse Engineering from a Timing Diagram Given the timing diagram for a clocked sequential circuit (i.e., “state machine”) determine the state transition graph Clock Input Output State FFA FFB How many Flip-Flops? Rising or falling edge triggered? Moore or Mealy machine? Monday, November 9 CEC 220 Digital Circuit Design

Timing Analysis of State Machines 3 Timing Analysis of State Machines 3. Reverse Engineering from a Timing Diagram Clock Input Output State FFA FFB 1 1 1 1 x=0 / falling edge triggered S0 S1 x=1 / x=0 / Mealy Machine x=1 / x=1 / 1 S2 x=0 / Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 3. Reverse Engineering from a Timing Diagram Develop the State Transition Table Present State Next State Present Output (Z) X=0 X=1 S0 S1 S2 S0 S1 S2 S1 S0 S1 1 Present State Next State Present Output (Z) X=0 X=1 00 01 10 1 11 XX X Present State Next State Present Output (Z) X=0 X=1 00 01 10 1 11 X State Encoding QAQB S0 = 00 S1 = 01 S2 = 10 Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 4. Reverse Engineering from a Circuit Given the sequential circuit determine the state transition table & graph 𝐷 𝐴 𝑄 𝐴 𝑄 𝐴 𝐷 𝐵 𝑄 𝐵 𝑄 𝐵 Clk Z x How many states? Moore or Mealy machine? Input Logic Flip-Flops Output Logic Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines 4. Reverse Engineering from a Circuit Could use the FF Excitation Eqns And go directly to Next State Cols!! Develop the State Transition Table Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 (𝑸 𝑨 + 𝑸 𝑩 + ) X=1 DA DB 00 01 10 1 11 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 (𝑸 𝑨 + 𝑸 𝑩 + ) X=1 DA DB 00 01 10 11 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 (𝑸 𝑨 + 𝑸 𝑩 + ) X=1 DA DB 00 0 0 0 1 01 1 0 10 1 11 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) Flip-Flop Inputs X=0 (𝑸 𝑨 + 𝑸 𝑩 + ) X=1 DA DB 00 0 0 0 1 01 1 0 10 1 11 Mealy Machine Four States Monday, November 9 CEC 220 Digital Circuit Design

Develop the state transition graph Timing Analysis of State Machines 4. Reverse Engineering from a Circuit If we start at S00, S01, or S10 we will never reach S11 Develop the state transition graph x=0 / 0 Present State 𝑸 𝑨 𝑸 𝑩 Next State Present Output (Z) X=0 (𝑸 𝑨 + 𝑸 𝑩 + ) X=1 00 0 0 0 1 01 1 0 10 1 11 S00 x=0 / x=1 / 0 x=1 / 0 x=1 / 1 S01 S10 x=0 / 0 x=0 / 0 x=1 /1 Compare this graph with the one obtained from the prior waveform example. S11 We can effectively ignore S11 Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines Method#1: VHDL Code to generate these Examples Moore State Machine: Cases 1 & 2 Mealy State Machine: Cases 3 & 4 See course webpage for VHDL code Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Timing Analysis of State Machines Method#2: VHDL Code to generate these Examples Moore State Machine: Mealy State Machine: See course webpage for VHDL code Monday, November 9 CEC 220 Digital Circuit Design

CEC 220 Digital Circuit Design Next Lecture Sequence Detector design Monday, November 9 CEC 220 Digital Circuit Design