1 Design a state machine to display a character of string HELLO using a seven segment display How many state we need? –Five, one for each character –In.

Slides:

Advertisements

Similar presentations

Lab 2: Finite State Machines CS 3410 Spring 2015.

Advertisements

Counters Discussion D8.3.

Clocked Synchronous State-machine Analysis

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)

State Machine Design Procedure

CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1.

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.

1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.

CS 140 Lecture 9 Professor CK Cheng 4/30/02. Part II. Sequential Network 1.Memory 2.Specification 3.Implementation S XY s i t+1 = g i (S t, x t )

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.

EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.

Give qualifications of instructors: DAP

EECC341 - Shaaban #1 Lec # 16 Winter State Machine Design Procedure 1. Build state/output table (or state diagram) from word description.

Sequential Circuit Analysis. 2 Synchronous vs. Asynch. Synchronous sequential circuit:  The behavior can be defined from knowledge of its signal at discrete.

CS 140 Lecture 10 Professor CK Cheng 10/29/02. Part II. Sequential NetworkReminder 1.Flip flops 2.Specification 3.Implement Netlist  State Table  State.

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.

CS 140L Lecture 7 Transformation between Mealy and Moore Machines Professor CK Cheng CSE Dept. UC San Diego.

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.

Advanced Digital Circuits ECET 146 Week 5 Professor Iskandar Hack ET 221G, Me as I typed this slides.

Moore machine and Mealy machine (P.274)

Lecture 18 More Moore/Mealy machines.

Introduction to Sequential Logic Design Finite State-Machine Design.

ECE 3130 – Digital Electronics and Design Lab 6 State Machines Fall 2012 Allan Guan.

Advanced Digital Circuits ECET 146 Week 9 Professor Iskandar Hack ET 221G,

Copyright © 1997 Altera Corporation 6/5/2016 P.1 AHDL Training Class Danny Mok Altera HK FAE

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,

Chapter 04 Tutorial Using StateCAD. Objective This tutorial will give you exposure to using StateCAD and VHDL Using HDL Bencher and Modelsim for simulating.

CSIE.NCTU, DL-6-1 Basic Design Approach of FSM Six Step Process 1. Understand the statement of the Specification 2. Obtain an abstract specification of.

Lab 7 : Overview State Machine : Moore Model Concept in designing a Vending Machine.

DLD Lecture 26 Finite State Machine Design Procedure.

1 A counter counts Number of elements in counter determines how many different states we need For example, an eight-state counter can count eight steps.

Sequential Circuit: Analysis BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.

Lecture 8 Theory of AUTOMATA

Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.

CEC 220 Digital Circuit Design Timing Analysis of State Machines

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.

University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell State Machines.

1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

Computing Machinery Chapter 4: Finite State Machines.

CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.

University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell State Machines.

Sichuan University Software College

© 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.

Sequential Circuit: Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.

Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.

Finite State Machines Mealy machine inputs Outputs next state function

Introduction to Sequential Logic Design

Sequential logic design principles

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

Instructor: Alexander Stoytchev

CSE 140L Discussion Finite State Machines.

Finite State Machines Experiment 4 Introduction

D Flip-Flop Schematic Block Symbol Truth Table D Q Clk Q Clk D Q(t+1)

SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.

Instructor: Alexander Stoytchev

Lecture 22 Logistics Last lecture Today HW7 is due on Friday

Finite Automata with Output

CS 140L Lecture 7 Transformation between Mealy and Moore Machines

Lecture 22 Logistics Last lecture Today HW7 is due on Friday

Presentation transcript:

1 Design a state machine to display a character of string HELLO using a seven segment display How many state we need? –Five, one for each character –In state S0 (000) we display H –In state S1 (001) we display E –In state S2 (010) we display L –In state S3 (011) we display L –In state S4 (100) we display O State transitions are S0 -> S1 S1 -> S2 S2 -> S3 S3 -> S4 S4 -> S5 Another Example

2 Example (contd.) Next State and Output logic tables are CurNextStateOutput S0S1S2S3 S4

3 Moore State Machine Diagram y !y y yy s3 0 s2 1 s1 1 s0 0

4 SUBDESIGN moore1 ( clk, reset, y: INPUT; z: OUTPUT; ) VARIABLE% currentcurrent % % stateoutput % ss :MACHINE OF BITS (z) WITH STATES ( s0= 0, s1= 1, s2= 1, s3= 0); BEGIN ss.clk = clk; ss.reset = reset; TABLE %currentcurrentnext% %stateinputstate% ss,y=>ss; s0,0=>s0; s0,1=>s2; s1,0=>s0; s1,1=>s2; s2,0=>s2; s2,1=>s3; s3,0=>s3; s3,1=>s1; END TABLE; END; Moore machine in AHDL

5 Mealy State Machine Diagram 0/0 y 1/1 0/1 1/11/0 0/0 s2 s1 s3 s0

6 Mealy Machine in AHDL SUBDESIGN mealy ( clk, reset, y: INPUT; z: OUTPUT; ) VARIABLE ss :MACHINE WITH STATES (s0, s1, s2, s3); zd :NODE; BEGIN ss.clk = clk; ss.reset = reset; TABLE %currentcurrentcurrentnext% %stateinputoutputstate% ss,y=>z,ss; s0,0=>0,s0; s0,1=>1,s1; s1,0=>1,s1; s1,1=>0,s2; s2,0=>0,s2; s2,1=>1,s3; s3,0=>0,s3; s3,1=>1,s0; END TABLE; END;