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

Slides:

Advertisements

Similar presentations

Sequential Circuits Storage elements

Advertisements

State-machine structure (Mealy)

TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.

Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.

A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.

Classification of Digital Circuits  Combinational. Output depends only on current input values.  Sequential. Output depends on current input values and.

Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Digital Electronics Chapter 5 Synchronous Sequential Logic.

SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 6 – Part 1.

CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.

Computing Machinery Chapter 5: Sequential Circuits.

Circuits require memory to store intermediate data

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.

Finite Automata with Output

CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.

COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.

ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.

COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.

ENGIN112 L20: Sequential Circuits: Flip flops October 20, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 20 Sequential Circuits: Flip.

CHAPTER 3 Digital Logic Structures

CS 151 Digital Systems Design Lecture 20 Sequential Circuits: Flip flops.

A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.

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.

Counting with Sequential Logic Experiment 8. Experiment 7 Questions 1. Determine the propagation delay (in number of gates) from each input to each output.

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.

Sequential Circuits. Combinational Circuits + Storage element output depends both on previous state and input Fig. 5-1.

State Machines.

Synchronous Sequential Logic Chapter 5. Digital Circuits Sequential Circuits Combinational circuits contains no memory elements the outputs depends.

Chapter 2Basic Digital Logic1 Chapter 2. Basic Digital Logic2 Outlines  Basic Digital Logic Gates  Two types of digital logic circuits Combinational.

Moore machine and Mealy machine (P.274)

Introduction to Sequential Logic Design Finite State-Machine Design.

CPEN Digital System Design Chapter 5 - Sequential Circuits Sequential Circuit Design C. Gerousis © Logic and Computer Design Fundamentals, 4 rd Ed.,

Lecture # 15 Theory Of Automata By Dr. MM Alam 1.

Review of Digital Logic Design Concepts OR: What I Need to Know from Digital Logic Design (EEL3705)

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,

1 Recap lecture 22 Applications of complementing and incrementing machines, Equivalent machines, Moore equivalent to Mealy, proof, example, Mealy equivalent.

Digital Logic Design.

ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.

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.

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.

Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.

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

CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.

5 - 1 Chapter 6 Analysis of Sequential Systems Chapter 6 Analysis of Sequential Systems 6.0 Introduction  Clocked System Clock A signal that alternates.

CENG 241 Digital Design 1 Lecture 7 Amirali Baniasadi

Dept. of Electrical Engineering

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 Advanced Theory of Computation Finite Automata with output Pumping Lemma Theorem.

Finite Automata (FA) with Output FA discussed so far, is just associated with R.Es or language. Is there exist an FA which generates an output string corresponding.

Lecture #17: Clocked Synchronous State-Machine Analysis

Introduction to Sequential Logic Design

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and so on require.

Assistant Prof. Fareena Saqib Florida Institute of Technology

Sequential logic circuits

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

Recap lecture 23 Mealy machines in terms of sequential circuit.

Lecture 14: State Tables, Diagrams, Latches, and Flip Flop

Finite Automata with Output

Chapter 5 Sequential Circuits.

Finite Automaton with output

Mealy and Moore Machines

Presentation transcript:

Mealy and Moore Machines Lecture 8

Overview Moore Machines Mealy Machines Sequential Circuits

A Moore Machine q 0 /1 q 1 /0 q 2 /0 q 3 /1 a a a bb b a,b

Definition of a Moore Machine A finite set of states –q 0, q 1, q 2, etc. –q 0 is the start state Alphabet of input letters Alphabet of output letters Transitions –A unique one for each letter and each state Output Table –A letter for each state

Moore Machine for aba q 3 /1 aab a b b a,b q 0 /0q 1 /0q 2 /0 q 4 /0

Defining a Language To change a FA into a Moore machine which accepts the same language –Name each state –Name the Start state q 0 –Output 0 in all non-final states –Output 1 in all Final states. A string is accepted if after it has been completed read in the last letter printed is 1.

A Mealy Machine q0q0 q1q1 q2q2 b/0 a/0 a/1 a/1, b/1 b/0

Definition of a Mealy Machine A finite set of states –q 0, q 1, q 2, etc. –q 0 is the start state Alphabet of input letters Alphabet of output letters Transitions –A unique one for each letter and each state –Each transition also has one output letter

Equivalence of Machines Every Moore machine can be turned into a Mealy machine. Every Mealy machine can be turned into a Moore machine. Every regular language can be defined by Moore machine or a Mealy machine. All languages defined by a Moore machine or a Mealy machine are regular.

Sequential Circuits The output depends on the sequence of past inputs. The circuits consist of –a logic gates i.e. AND, OR, NOT, NAND, NOR –storage elements i.e. flip-flops, latches.

Clocked Synchronous Sequential Circuits Clocked –Means all the flip-flops employ a clock input. Synchronous –Means all the flip-flops use the same clock signal. These circuits only change state when a triggering edge or “tick” occurs on the clock signal.

Logic Gates AND NOT OR A B A B A

D Flip-Flop Stores one bit of information new value of Q = old value of D Q* = D DQ Q CLK NOT Q

Moore Circuit Next State Logic Circuit State Memory Output Logic Circuit clock input clock signal input output

Moore Machine q 0 /1 q 1 /0 q 2 /0 q 3 /1 a a a bb b a,b

Mealy Circuit Next State Logic Circuit State Memory Output Logic Circuit clock input clock signal input output

Mealy Machine q0q0 q1q1 q2q2 b/0 a/0 a/1 a/1, b/1 b/0

IN AND OUT OR D 1 = IN D 2 = IN OR ((Q 1 AND Q 2 ) OR (NOT Q 2 )) OUT = Q 1 AND Q 2 Q 1 * = D 1 Q 2 * = D 2 D2D2 clock signal OR D1D1 Q1Q1 Q2Q2 Q2Q2

D 1 = IN D 2 = IN OR ((Q 1 AND Q 2 ) OR (NOT Q 2 )) OUT = Q 1 AND Q 2 Q 1 * = D 1 Q 2 * = D 2

q0q0 q3q3 q2q2 q1q1 0/0 1/0 0/11/0 0/0 1/0 0/0 1/1

q0q0 q1q1 q2q2 1/0 0/0 0/1 0/1, 1/1 1/0 Exercise Find the corresponding sequential circuit for the following Mealy Machine.

q0q0 q1q1 q2q2 1/0 0/0 0/1 0/1, 1/1 1/0 Choose an unique binary code for each state.

q0q0 q1q1 q2q2 1/0 0/0 0/1 0/1, 1/1 1/0 Choose an unique binary code for each state.

A * = (  A   B  IN )  (A   B  IN ) B * = (A  B   IN )  (  A  B   IN ) OUT = (  A   B   IN )  (  A  B  IN )  (  A  B   IN )

A * = IN  (  B ) B * =  A * OUT = (  A )  (  IN  B )

A*A* A AND IN AND OUT Delay NOT Delay B B*B* NOT OR NOT A * = IN  (  B ) B * =  A * OUT = (  A )  (  IN  B )

Preparation Read –Chapters 12 of the Text BookRevision Know what the following machines are and how to use them. Moore Machine Mealy Machine Be able to find the equations for a sequential circuit corresponding to a Mealy machine.