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.

Slides:



Advertisements
Similar presentations
ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.
Advertisements

Chapter #8: Finite State Machine Design Contemporary Logic Design
Chapter #8: Finite State Machine Design 8
Introduction to Sequential Circuits
Finite State Machines (FSMs)
Sequential Circuits Storage elements
State-machine structure (Mealy)
State Machine Design Procedure
Analysis of Clocked Sequential Circuits
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Give qualifications of instructors: DAP
Circuits require memory to store intermediate data
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
Sequential Circuit Design
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
1 CS 140 Lecture 9 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.
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.
1 COMP541 State Machines Montek Singh Feb 6, 2007.
Sequential Circuit Design
ECE C03 Lecture 121 Lecture 12 Finite State Machine Design Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
ENEE 408C Lab Capstone Project: Digital System Design Fall 2005 Sequential Circuit Design.
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
Lecture 17 General finite state machine (FSM) design
1 COMP541 State Machines Montek Singh Feb 8, 2012.
ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.
Lecture 2 Sequential Logic Design 2007/09/14 Prof. C.M. Kyung.
Chapter #8: Finite State Machine Design
Hussein Bin Sama && Tareq Alawneh
Chapter 11: System Design Methodology Digital System Designs and Practices Using Verilog HDL and 2008, John Wiley11-1 Ders 8: FSM Gerçekleme ve.
Lecture 18 More Moore/Mealy machines.
1 Lecture 22 State encoding  One-hot encoding  Output encoding State partitioning.
Introduction to Sequential Logic Design Finite State-Machine Design.
1 CSE370, Lecture 19 Lecture 19 u Logistics n Lab 8 this week to be done in pairs íFind a partner before your lab period íOtherwise you will have to wait.
Introduction to State Machine
Lecture 6 Coffee Vending Machine using FPGA
1 CSE370, Lecture 18 Lecture 20 u Logistics n HW6 due Wednesday n Lab 7 this week (Tuesday exception) n Midterm 2 Friday (covers material up to simple.
Lab 7 : Overview State Machine : Moore Model Concept in designing a Vending Machine.
DLD Lecture 26 Finite State Machine Design Procedure.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.
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.
1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.
1 COMP541 Finite State Machines - 1 Montek Singh Sep 22, 2014.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Synthesis Synchronous Sequential Circuits synthesis procedure –Word description of problem /hardest; art, not science/ –Derive state diagram & state table.
1 COMP541 Sequential Logic – 2: Finite State Machines Montek Singh Feb 29, 2016.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.

Figure 8.1. The general form of a sequential circuit.
© Copyright 2004, Gaetano Borriello and Randy H. Katz
COMP541 Sequential Logic – 2: Finite State Machines
FIGURE 5.1 Block diagram of sequential circuit
FINITE STATE MACHINES (FSMs)
ECE 3130 – Digital Electronics and Design
FSM MODELING MOORE FSM MELAY FSM. Introduction to DIGITAL CIRCUITS MODELING & VERIFICATION using VERILOG [Part-2]
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 20 Logistics Last lecture Today HW6 due Wednesday
Instructor: Alexander Stoytchev
Lecture 18 Logistics Last Lecture Today HW6 due today Midterm 2
Lecture 18 Logistics Last lecture Today HW5 due today (with extra 10%)
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
CSE 370 – Winter Sequential Logic-2 - 1
Presentation transcript:

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 the FSM 3. Perform a state minimization 4. Perform state assignment 5. Develop Verilog description of the FSM 6. Use logic synthesis tools to generate gate-level circuits 3, 4, can be done by logic synthesis tools

CSIE.NCTU, DL-6-2 Example: Vending Machine FSM General Machine Concept: deliver a can of coke-cola after 15 dollars deposited single coin slot for $5, $10 no change Block Diagram Step 1. Understand the problem: Vending Machine FSM 5 10 Reset Clk Open Coin Sensor Coke-cola Release Mechanism Draw a picture!

CSIE.NCTU, DL-6-3 Vending Machine Example Tabulate typical input sequences: three $5 $5, $10 $10, $5 two $10 two $5, %10 Draw state diagram: Inputs: F, T, reset Output: open Step 2. Map into more suitable abstract representation Reset F F F T T F T [open] S0 S1S2 S3 S4 S5 S6 S8 [open] S7 T

CSIE.NCTU, DL-6-4 Step 3: State Minimization Reset F F F, T [open] $15 $0 $5 $ 10 T F reuse states whenever possible Symbolic State Table Present State $0 $5 $10 $15 T X F X Inputs Next State $0 $5 $10 X $5 $10 15 X $10 15¢ X $0 Output Open X X X 1 Vending Machine Example

CSIE.NCTU, DL-6-5 Verilog Development Mealy machine or Moore machine? –If the outputs are functions of the internal state? Separate combinational circuits and FF’s –combinational circuits Boolean functions of next state Boolean functions of the outputs –FF’s current state <= next state