Module : FSM Topic : types of FSM. Two types of FSM The instant of transition from the present to the next can be completely controlled by a clock; additionally,

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

Finite State Machines (FSMs)
Lecture #24 Page 1 EE 367 – Logic Design Lecture #24 Agenda 1.State Machines Review Announcements 1.n/a.
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.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Computing Machinery Chapter 5: Sequential Circuits.
Circuits require memory to store intermediate data
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
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
1 Sequential logic networks I. Motivation & Examples  Output depends on current input and past history of inputs.  “State” embodies all the information.
Sequential Circuits and Finite State Machines Prof. Sin-Min Lee
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.
Overview Sequential Circuit Design Specification Formulation
A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.
ENEE 408C Lab Capstone Project: Digital System Design Fall 2005 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)
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
Introduction Flip-flops are synchronous bistable devices. The term synchronous means the output changes state only when the clock input is triggered. That.
Lecture 17 General finite state machine (FSM) design
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
Lecture 10 Topics: Sequential circuits Basic concepts Clocks
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Topics n Basics of sequential machines. n Sequential machine specification. n Sequential.
Digital Computer Design Fundamental
1 COMP541 State Machines Montek Singh Feb 8, 2012.
Circuit, State Diagram, State Table
Chap 4. Sequential Circuits
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits Previously, we described the basic building blocks of sequential circuits,
Introduction to State Machine
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,
DLD Lecture 26 Finite State Machine Design Procedure.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
VHDL Discussion Finite State Machines
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
VHDL Discussion Finite State Machines IAY 0600 Digital Systems Design Alexander Sudnitson Tallinn University of Technology 1.
Digital System Design using VHDL
CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.
A sequential logic circuit (a.k.a. state machine) consists of both combinational logic circuit(s) and memory devices (flip flops). The combinational circuits.
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Synchronous Counter Design
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
Flip Flops 3.1 Latches and Flip-Flops 3 ©Paul Godin Created September 2007 Last Edit Aug 2013.
Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 8 of 8 Dr. Clincy Professor of CS.
Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.
TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.
Govt. Engineering College- Gandhinagar. It is all about……  STATE MACHINE.
1 Registers A register is a group of n flip-flops each of them capable of storing one bit of information There are two types of registers: parallel and.
ANALYSIS OF SEQUENTIAL CIRCUITS
Introduction to Advanced Digital Design (14 Marks)
Introduction Introduction to VHDL Entities Signals Data & Scalar Types
Sequential Logic Counters and Registers
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Fundamentals
CSE 140L Discussion Finite State Machines.
Instructor: Alexander Stoytchev
CSE 370 – Winter Sequential Logic-2 - 1
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
Forward Design by state transition table, and state graph
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
CSE 370 – Winter Sequential Logic-2 - 1
Presentation transcript:

Module : FSM Topic : types of FSM

Two types of FSM The instant of transition from the present to the next can be completely controlled by a clock; additionally, changes in the inputs may also dictate such transitions. FSMs can be broadly classified into two categories – Moore machines and Mealy machines.

Moore machine Two aspects characterizes Moore machine : Next state of the output is decided fully by the present state. All changes in the output are brought about only at the active edge of the clock. Hence the Moore machine is inherently synchronous. Edge-triggered flip flops, synchronous counters, etc, are typical example of Moore machines. Moore machine are also known as synchronous machine.

Generate a state diagram from the problem statement. Minimize the number of states Select a binary encoding for the states. Generate an encoded state table. Select the memory device – T flip-flop or D flip-flop Generate a next-state K map for each memory device. Generate a K map for each output. Implement memory and combinational logic using PLAs or other devices.

Example of sequence detector A sequence generator is to sequence through eight distinct states. The states are represented by a set of four binary variables – W, X, Y and Z. the states and the sequence are as follows ( the 4 bits represent values of W, X, Y and Z, respectively) : 1000  1100  0100  0110  0010  0011  0001  1001  1000 … Each transition is to take place at the positive edge of the clock. Since the scheme has no external primary input to affect the output, it is realized as a Moore machine.

Example 1 : solution A 3-bit state machine suffices to generate the eight independent states specified. Continued to next page….

Test Bench

Mealy Machine Mealy machine differs from the Moore machine at the output stage. The inputs can affect the outputs directly in Mealy Machine. The changes in the input reflect as corresponding changes in the outputs without the clock being directly involved : to that extent the behavior is asynchronous. Counters with asynchronous preset and clear and shift registers with preset are examples of Mealy machines. A Mealy machine has to respond to changes in input in addition to the response to the active edges of the clock.

Example of Mealy machine A sequence generator is to have four binary outputs designated W, X, Y, and Z. they are to follow either of two sequences depending on the value of a Boolean variable A: If A = 0, the sequence to be followed is 1000  1100  0100  0110  0010  0011  0001  1001  1000 … where, W is the most significant bit and Z the least significant bit. If A=1, the sequence to be followed is : 1001  0001  0011  0010  0110  0100  1100  1000  1001 ….

Example 2 : Solution

Diagram for Moore & mealy machine Moore machineMealy machine