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.

Slides:

Advertisements

Similar presentations

These slides incorporate figures from Digital Design

Advertisements

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

Sequential Circuits Storage elements

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

CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.

1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.

Sequential Design Part II. Output A(t+1) =D A = AX + BX B(t+1) =D B = AX Y = AX + BX.

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

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

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 )

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 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.

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)

CSCE 211: Digital Logic Design

Spring 2002EECS150 - Lec15-seq2 Page 1 EECS150 - Digital Design Lecture 15 - Sequential Circuits II (Finite State Machines revisited) March 14, 2002 John.

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.

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)

ECE 301 – Digital Electronics

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

ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)

Synchronous Sequential Logic Part II

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

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

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.

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

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

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

CSE 140 Lecture 8 Sequential Networks

Sequential Networks and Finite State Machines

Sequential logic design principles

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

ECE 301 – Digital Electronics

CSE 140 MT 2 Review By Daniel Knapp.

Sequential Networks and Finite State Machines

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

CSE 370 – Winter Sequential Logic-2 - 1

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

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

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

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

CSE 140 Lecture 9 Sequential Networks

Lecture 22 Logistics Last lecture Today HW7 is due on Friday

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

Lecture 22 Logistics Last lecture Today HW7 is due on Friday

CSE 370 – Winter Sequential Logic-2 - 1

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

Presentation transcript:

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 Diagram

X T Q Q’ T Q y Q0Q0 Q1Q1 T0T0 T1T1 y(t) = Q 1 (t)Q 0 (t) Q 0 (t+1) = T 0 (t) = X(t) Q 1 (t) Q 1 (t+1) = T 1 (t) = X(t) + Q 0 (t)

PS inputs x=0 x=1 State table 00, 0 10, 0 10, 0 00, 0 11, 0 10, 0 11, 1 Q 1 (t) Q 0 (t) Q 1 (t+1) Q 0 (t+1), y(t) id Q 1 (t) Q 0 (t) X(t) T 1 (t) T 0 (t) Q 1 (t+1) Q 0 (t+1) , All three forms are equivalent. Given one, we can derive the other ones.

Implement: Language  State Diagram  State Table  Netlist Language 1 – Pattern recognizer A sequential machine has one binary input x for x(t-2, t) = aab, the output y(t) = 1, otherwise y(t) = 0. (Essentially, if we see a string matching aab, we output 1). S1S0 a/0 b/0 s0s0 a/0 b/1 S2 a/0

s0s1s2s0s1s2 PS X a b s 1 / 0 s 0 / 0 s 2 / 0 s 0 / 0 s 2 / 0 s 1 / 1 State table PS inputs X=0 X=1 01, 0 00, 0 10, 0 00, 0 10, 0 00, 1 Q 1 (t) Q 0 (t) Q 1 (t+1) Q 0 (t+1), y(t) = D 1 (t),D 0 (t) State Assignment s 0 :00 s 1 :01 s 2 :10

x(t) Q1Q Q0Q0 D 1 (t): D 1 (t) = x’Q 0 + x’Q 1 (Repeat for D 0 )

D Q Q’ D Q Q1Q1 Q0Q0 D1D1 D0D0 x Q1Q1 Q0Q0

Another example Language 1 – Pattern recognizer A sequential machine has one binary input x for x(t-2, t) = aba, the output y(t) = 1, otherwise y(t) = 0. (Essentially, if we see a string matching aba, we output 1). S0 a/0 b/0 s0s0 a/0 b/0 S2 b/0 S1 a/1

1 10 init 1/0 0/0 s0s0 s1s1 s2s2 10 s2s2 1/0 0/0 1/1 0/1 1/0 Another example Language 1 – Pattern recognizer Given a sequential machine that recognizes patterns 110 or 101, draw the state diagram. Overlap is allowed.

Canonical Form Combinational Logic x(t) y(t) CLK C2 C1 y(t) CLK x(t) C1C2 CLK x(t) y(t)

Moore Machine: y(t) = f(x(t), s(t)) Mealy 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)