TOPIC : State Tables UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.

Slides:



Advertisements
Similar presentations
Counters Discussion D8.3.
Advertisements

Clocked Synchronous State-machine Analysis
TOPIC : Reduced Ordered Binary Decision Diagrams UNIT 1: Modeling Digital Circuits Module 1 : Functional Modeling.
Computer Architecture CS 215
SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 6 – Part 1.
Computing Machinery Chapter 5: Sequential Circuits.
Lecture 22: Sequential Circuits Today’s topic –Clocks and sequential circuits –Finite state machines 1.
1 EE365 Sequential-circuit analysis. 2 Clocked synchronous seq. circuits A.k.a. “state machines” Use edge-triggered flip-flops All flip-flops are triggered.
CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.
Sequential Logic Design with Flip-flops
Registers.1. Register  Consists of N Flip-Flops  Stores N bits  Common clock used for all Flip-Flops Shift Register  A register that provides the.
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.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.
1 COMP541 State Machines Montek Singh Feb 6, 2007.
Overview Finite State Machines - Sequential circuits with inputs and outputs State Diagrams - An abstraction tool to visualize and analyze sequential circuits.
 We can use an algebraic description of the circuit ’ s functional behavior in the analysis of a larger system that includes the circuit.  We can determine.
Overview Finite State Machines
TOPIC : Truth tables and Primitive Cubes
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
ECE 331 – Digital System Design Sequential Circuit Design (Lecture #23) The slides included herein were taken from the materials accompanying Fundamentals.
1 Synchronous Sequential Circuit Analysis. 2 Synchronous Sequential Circuit State Memory – A set of n edge-triggered flip-flops that store the current.
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic CMOS logic elements Combinational logic elements and design.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR1 Sequential Circuit Design.
Digital Computer Design Fundamental
Rosen 5th ed., ch. 11 Ref: Wikipedia
Analyzing our example circuit
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 =
Circuit, State Diagram, State Table
TOPIC : Introduction to Functional Modeling UNIT 1: Modeling Digital Circuits Module 1 : Functional Modeling.
Chap 4. Sequential Circuits
Sequential Circuits. Combinational Circuits + Storage element output depends both on previous state and input Fig. 5-1.
Digital Logic Design Sequential circuits
Guide to State Transition Diagram. 2 Contents  What is state transition diagram?  When is state transition diagram used?  What are state transition.
Introduction to Sequential Circuit By : Pn Siti Nor Diana Ismail CHAPTER 5.
Introduction to Sequential Logic Design Finite State-Machine Design.
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
9/15/09 - L21 Sequential Circuit Analaysis Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Analysis.
Fall 2004EE 3563 Digital Systems Design EE3563 Chapter 7, 8, 10 Reading Assignments  7.1, 7.2, 7.3  8.1, ,   8.5.1, 8.5.2,
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Finite State Machines CS147 : Presentation by Mabel Thong (9/25/07)
Registers; State Machines Analysis Section 7-1 Section 5-4.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
Unit1: Modeling & Simulation Module5: Logic Simulation Topic: Unknown Logic Value.
Sequential circuit analysis1 Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units.
What is Science? Science comes from the Latin word “scire”
TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.
State Diagrams Tuesday, 12 September State diagram Graphical representation of a state table. –Provides the same information as a state table. –A.
Combinational Design, Part 2: Procedure. 2 Topics Positive vs. negative logic Design procedure.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
© 2016 AQA. Created by Teachit for AQA Boolean logic Lesson 3.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Counters & Sequential Circuit Design
ANALYSIS OF SEQUENTIAL CIRCUITS
Multiplexer.
Analysis of Clocked Sequential Circuit
Activity Diagrams Activity diagrams describe the workflow behavior of a system.  The diagrams describe the state of activities by showing the sequence.
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.
Waveforms & Timing Diagrams
Logic Gates.
Sequential circuit analysis: kale
Sequential circuit analysis
FINITE STATE MACHINES.
ECE 352 Digital System Fundamentals
Sequential Circuit Analysis
Copyright © Cengage Learning. All rights reserved.
Lesson 1.7 Represent Functions as Graphs
EGR 2131 Unit 12 Synchronous Sequential Circuits
Announcements Assignment 7 due now or tommorrow Assignment 8 posted
Presentation transcript:

TOPIC : State Tables UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits

State Diagrams Used to give an abstract description of the behavior of a system. The behavior is analyzed and represented in series of events, that could occur in one or more possible states. Example:

State diagrams of various flip-flops

State Tables It is one of many ways to specify a state machine. It is essentially a truth table whose ◦ Inputs  actual inputs and the current state ◦ Outputs  actual outputs and the next state It is a table showing what state a state machine will move to, based on the current state and other inputs.

One-dimensional State Tables Similar to truth tables Columns  naming of states, inputs, outputs Rows  Different possible signals Left side  Inputs, Right side  Outputs ABCurrent State Next State Output 00S1S21 00 S10 01 S20 01 S11 10 S21 10 S11 11 S21 11 S10

Two-dimensional State Tables Two forms of arranging them. 1)Vertical dimension  current states, horizontal  events, cells  contain the next state if an event happens S: state, E: event, A: action, --: illegal transition Events State E1E1 E2E2....EnEn S1S1 --A y /S j ….-- S2S2 ….A x /S i....…. SmSm A z /S k --….--

Contd … 2) Vertical dimension  current states, horizontal  events, cells  contain the next state if an event happens S: state, E: event, A: action, -: impossible transition Next current S1S1 S2S2 ….SmSm S1S1 A y /E j --….-- S2S2 ….A x /E i …. SmSm --A z /E k ….--

Example of a State-Table Input State 10 S1S1 S1S1 S2S2 S2S2 S2S2 S1S1 Columns  possible inputs Rows  possible states One can observe that from one of the above representations, other representation can beFound.

Transformation to state diagram Draw the circles to represent the states given. For each of the states, scan across the corresponding row and draw an arrow to the destination state(s). Designate a state as the start state. Designate one or more states as accept state.