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 )

Slides:

Advertisements

Similar presentations

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

Advertisements

EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Sequential Circuits.

Princess Sumaya University

1 Sequential Systems A combinational system is a system whose outputs depend only upon its current inputs. A sequential system is a system whose outputs.

Circuits require memory to store intermediate data

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 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 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

Sequential Logic Design

CSE 140 Lecture 8 Sequential Networks 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.

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

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

Sequential Logic Design

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)

Sequential System Synthesis -- Introduction

Sequential Circuit Design

EE 4271 VLSI Design, Fall 2010 Sequential Circuits.

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 140 Lecture 18 Professor CK Cheng 12/3/02. Standard Sequential Modules 1.Register 2.Shift Register 3.Counter.

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.

ECE 331 – Digital System Design Counters (Lecture #19) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

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)

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

CS 140 Lecture 19 Professor CK Cheng 12/05/02. Sequential Machine Standard Modules Combinational Sequential System Designs.

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.

Overview Part 1 - Storage Elements and Sequential Circuit Analysis

Unit 11 Latches and Flip-Flops Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh.

D Flip-Flops Objectives

ECE 320 Homework #6 Derive the state table and state diagram of the sequential circuit of the Figure below. What is the function of the circuit? A’ A.

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

SEQUENTIAL CIRCUITS Introduction

Analyzing our example circuit

T Flip-Flop A T (toggle) flip-flop is a complementing flip-flop and can be obtained from a JK flip-flop when the two inputs are tied together. When T =

Digital Design Lecture 10 Sequential Design. State Reduction Equivalent Circuits –Identical input sequence –Identical output sequence Equivalent States.

Boolean Algebra and Logic Gates 1 Computer Engineering (Logic Circuits) Lec. # 10 (Sequential Logic Circuit) Dr. Tamer Samy Gaafar Dept. of Computer &

Counters - II. Outline  Synchronous (Parallel) Counters  Up/Down Synchronous Counters  Designing Synchronous Counters  Decoding A Counter  Counters.

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.

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

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

C HAPTER F IVE S YNCHRONOUS S EQUENTIAL L OGIC 1.

Princess Sumaya University

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

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 8 Sequential Networks

2018/5/2 EE 4271 VLSI Design, Fall 2016 Sequential Circuits.

Sequential Networks and Finite State Machines

Lab. on Finite State Machine

Sequential Circuit: Counter

Digital Design Lecture 9

2018/8/29 EE 4271 VLSI Design, Fall 2013 Sequential Circuits.

Sequential Networks and Finite State Machines

CSE 140 Lecture 10 Sequential Networks: Implementation

CSE 140: Components and Design Techniques for Digital Systems

CS 140 Lecture 19 Standard Modules

Chapter5: Synchronous Sequential Logic – Part 4

Sequential Circuits UNIT- IV

CSE 140 Lecture 9 Sequential Networks

CS 140L Lecture 7 Transformation between Mealy and Moore Machines

2019/9/26 EE 4271 VLSI Design, Fall 2012 Sequential Circuits.

Presentation transcript:

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 )

Example with D flip-flops x Q1Q1 Q0Q0 D Q Q’ D Q y Q0Q0 Q1Q1 D0D0 D1D1 y(t) = Q 1 (t)Q 0 (t) Q 0 (t+1) = D 0 (t) = x(t)Q 1 (t) Q 1 (t+1) = D 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) Q1Q0Q1Q0 x Q 1 (t) Q 0 (t) Q 1 (t+1) Q 0 (t+1) y(t) (can derive from state table) s0s1s2s3s0s1s2s3 PS inputs 0 1 s 0, 0 s 2, 0 s 2, 0 s 0, 0 s 3, 0 s 2, 0 s 3, 1 Let: s 0 = 00 s 1 = 01 s 2 = 10 s 3 = 11 ( Let’s remake the state table using symbols instead of binary code, e.g. ’00’)

State Diagram s1s1 s2s2 s3s3 s0s0 0, Example Run (sequence of inputs and outputs) Time Input State s 0 s 0 s 0 s 2 s 2 s 3 s 2 Output

Reminder D flip-flop: Q(t+1) = D(t) T flip-flop: Q(t+1) = Q(t) T’(t) + Q’(t) T(t) JK F-F: Q(t+1) = J(t) Q’(t) + K’(t) Q(t) SR F-F: Q(t+1) = Q(t) R’(t) + S(t) SR Q(t) R Q S Example w/ SR F-F:

Example with T flip-flops X Q1Q1 Q0Q0 T Q Q’ T Q y Q0Q0 Q1Q1 T0T0 T0T0 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.

/0 1/0 0/0 Examples going the other way Given the state diagram 1/1 1/0 s0s0 s1s1 s2s2 Input State s 0 s 1 s 1 s 2 s 3 s 1 s 2 s 1 s 1 s 2 s 1 s 2 s 1 Output This outputs 1 only on input sequence 101