CS 140L Lecture 7 Professor CK Cheng 11/12/02. Transformation between Mealy and Moore Machines Algorithm: 1) For each NS, z = S i, j create a state S.

Slides:

Advertisements

Similar presentations

Lab 2: Finite State Machines CS 3410 Spring 2015.

Advertisements

1 CSULB -- CECS 201 – A Primer for FSM’s © 2014 R.W. Allison.

Lecture #24 Page 1 EE 367 – Logic Design Lecture #24 Agenda 1.State Machines Review Announcements 1.n/a.

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

Lecture #9 EGR 277 – Digital Logic

CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.

1 CS 140 Lecture 12 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 17 Professor CK Cheng 11/26/02. System Designs 1.Intro 2.Spec 3.Implementation.

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 )

CS 140 Lecture 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

CS 140 Lecture 8 Professor CK Cheng 4/26/02. Part II. Sequential Network 1.Memory SR, D, T, JK, 2.Specification S XY s i t+1 = g i (S t, X t )

CS 140L Lecture 7 Professor CK Cheng 5/13/02. Announcements  State Assignment: Chapters 7.4.3, 7.7.3, kinds of coding: 1) Binary – [ log 2 n ]

1 CS 140 Lecture 9 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 6: Other Types of Gates Professor CK Cheng 1.

CS 140 Lecture 18 Professor CK Cheng 6/04/02. Part IV. System Designs Algorithm: { Input X, Y type bit-vector, start type boolean; Local-Object A, B type.

CS 140 Lecture 12 Professor CK Cheng 11/07/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

Give qualifications of instructors: DAP

CS 140 Lecture 10 Professor CK Cheng 5/02/02. Given the state table, implement with 2 JK flip flops id Q 1 (t) 0 1 Q 0 (t) X(t)

CSE 140L Lecture 6 Interface and State Assignment Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140L Lecture 9 Professor CK Cheng 6/03/02. transistors modules sequential machine system 1.Adders, Muxes 2.F-Fs and counters 3.Finite State Machine.

CS 140 Lecture 11 Professor CK Cheng 5/31/02. C1C2 CLK x(t) y(t) Sequential Network Implementation Mealy & Moore machine State Table  Netlist s(t) D(t)

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)

CS 140 Lecture 8 Professor CK Cheng 10/22/02. Part II. Sequential Network 1.Flip-flops SR, D, T, JK, State Table Characteristic Eq. Q(t+1) = f(x(t), Q(t)).

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.

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

CS 140 Lecture 9 Professor CK Cheng 10/24/02. Sequential Network 1.Components F-Fs 2.Specification D Q Q’ CLK.

CS 140 Lecture 7 Professor CK Cheng 10/17/02. Combinational Logic  Complete set of gates  Other types of gates 1)XOR 2)NAND / NOR 3)Block Diagram Transfers.

CS 151 Digital Systems Design Lecture 31 Read Only Memory (ROM)

CS 140L Lecture 4 Professor CK Cheng 10/22/02. 1)F-F 2)Shift register 3)Counter (Asynchronous) 4)Counter (Synchronous)

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.

State Machines.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

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

DLD Lecture 26 Finite State Machine Design Procedure.

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.

1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.

Counters Prepared by: Careene McCallum-Rodney. Introduction Counters uses a Toggle Flip Flops to count either UP or DOWN in binary. A toggle flip flop.

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

CSE 140: Components and Design Techniques for Digital Systems Lecture 9: Sequential Networks: Implementation CK Cheng Dept. of Computer Science and Engineering.

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.

Partitioning of a digital system.

Sequential Networks and Finite State Machines

Summary Latch & Flip-Flop

Mealy Machine x X1 X2 S S1 S2 S3 x X1 X2 S S1 Y1 Y2 S2 Y3 S3 outputs

Sequential Logic Counters and Registers

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

Digital Principles and Design Algorithmic State Machines

Sequential Networks and Finite State Machines

KU College of Engineering Elec 204: Digital Systems Design

Digital Logic & Design Dr. Waseem Ikram Lecture No. 34.

ECE 3130 – Digital Electronics and Design

Recap D flip-flop based counter Flip-flop transition table

CSE 140 Lecture 10 Sequential Networks: Implementation

CSE 140: Components and Design Techniques for Digital Systems

KU College of Engineering Elec 204: Digital Systems Design

CS 140L Lecture 6 Professor CK Cheng 5/05/02.

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.

CSE 140 Lecture 9 Sequential Networks

CS 140L Lecture 7 Transformation between Mealy and Moore Machines

CS 140L Lecture 6 Professor CK Cheng 11/05/02.

Presentation transcript:

CS 140L Lecture 7 Professor CK Cheng 11/12/02

Transformation between Mealy and Moore Machines Algorithm: 1) For each NS, z = S i, j create a state S i (j) 2) For each new state S i (j), repeat the row PS = S i 3) Replace NS, z = S i, j with state S i (j). Set z = j for row PS = S i (j) Input: State Table of Mealy machine

Mealy Machine: Example PS A B 00 A,0 A,1 01 A,1 B,0 10 A,1 B,0 (x,y) (NS, z) PS A0 A1 B 00 A0 A1 01 A1 B Moore Machine: 10 B (x,y) z 0 1 0

Mealy State Diagram A 10/0 B 00/1 10/0, 01/0

Moore State Diagram A0/0 A1/1 B/

Timing Diagrams Time step x y S z S z 0 A 0 A A 1 A A 0 A B1B0300B1B A 1 A A 1 A1 1 Mealy Moore (The output has a 1 clock shift between Mealy and Moore machines) A A1 1

1) Binary – [ log 2 n ] bits 000,001,110, etc. 2) Gray – can change by only 1 bit i.e. 000-> 001->011->010. 3) Johnson - [ n/2 ] (bits) number of flip flops. 4) One hot – n FF, n states State Assignment

One hot: Q i = 1 iff present state = S i. S0 0 S1 0 1 S D Q Q’ X X’ D Q Q’ X X’ D Q Q’ X X’ (X not true -> back to 1 st FF, else to 2 nd ) 1)Branch outs  Fan-outs with AND gates. 2)Branch ins  Collect tokens with an OR gate.