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

Slides:

Advertisements

Similar presentations

CS 140 Lecture 11 Sequential Networks: Timing and Retiming Professor CK Cheng CSE Dept. UC San Diego 1.

Advertisements

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

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

1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.

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

CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.

Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.

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

CS 140L Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.

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 7 Professor CK Cheng 4/23/02. Part II. Sequential Network (Ch ) 1.Flip-flops SR, D, T, JK, 2.SpecificationState Table 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 )

1 CS 140 Lecture 19 Sequential Modules Professor CK Cheng CSE Dept. UC San Diego.

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 )

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

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140L Lecture 5: Counters Professor CK Cheng CSE Dept. UC San Diego 1.

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.

CSE 140L Lecture 4 Flip-Flops, Shifters and Counters Professor CK Cheng CSE Dept. UC San Diego.

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

CS 140 Lecture 17 System Designs III Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140 Lecture 17 System Designs III Professor CK Cheng CSE Dept. UC San Diego 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.

Give qualifications of instructors: DAP

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

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.

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.

1 CS 140 Lecture 18 Sequential Modules: Serial Adders, Multipliers Professor CK Cheng CSE Dept. UC San Diego.

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.

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

CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.

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

CSE 140 Lecture 15 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

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

Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.

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

State Machines.

Lecture 18 More Moore/Mealy machines.

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

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

CEC 220 Digital Circuit Design Timing Analysis of State Machines

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

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

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

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

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

CSE 140 Lecture 8 Sequential Networks

Sequential Networks and Finite State Machines

Sequential Networks and Finite State Machines

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

CSE 140 Lecture 15 System Designs

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

CSE 370 – Winter Sequential Logic-2 - 1

CSE322 Mealy and Moore Machine

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)

CS 140 Lecture 19 Standard Modules

CS 140 Lecture 15 Sequential Modules

Professor CK Cheng CSE Dept. UC San Diego

CSE 140 Lecture 9 Sequential Networks

CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 11 February 23 W’05 Yutao He 4532B Boelter Hall

CS 140L Lecture 7 Transformation between Mealy and Moore Machines

CS 140L Lecture 8 Professor CK Cheng 11/19/02.

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

Presentation transcript:

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

Outlines Framework Procedure Example: Transform Example: State Diagram Example: Output Sequence

Transform from Mealy to Moore Machine Mealy Machine: y(t) = f(x(t), s(t)) Moore Machine:y(t) = f(s(t)) s(t+1) = g(x(t), s(t)) C1C2 CLK x(t) y(t) Mealy Machine C1C2 CLK x(t) y(t) Moore Machine s(t) 3

Transform from Mealy to Moore Machine 1) For each NS, z = S i,y 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,y j with state S i (j). Set output z = y j for row PS = S i (j) Algorithm Input: State Table of Mealy machine

Mealy Machine: Example PS A B 00 A,0 A,1 01 A,1 B,0 10 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 Machine A0/0 A1/1 B/ A 10/0 B 00/1 00/0, 01/1 10/0, 01/0 Moore Machine State Diagram

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 shifts by one clock from Mealy to Moore machine A A1 1