Sichuan University Software College

Slides:



Advertisements
Similar presentations
COE 202: Digital Logic Design Sequential Circuits Part 2
Advertisements

Clocked Synchronous State-machine Analysis
State-machine structure (Mealy)
Digital Electronics Chapter 5 Synchronous Sequential Logic.
Computing Machinery Chapter 5: Sequential Circuits.
1 EE365 Sequential-circuit analysis. 2 Clocked synchronous seq. circuits A.k.a. “state machines” Use edge-triggered flip-flops All flip-flops are triggered.
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.
Nonlinear & Neural Networks LAB. CHAPTER 13 Analysis of Clocked Sequential Circuit 13.1 A Sequential Parity Checker 13.2 Analysis by Signal Tracing 13.3.
ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.
Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.
EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.
Sequential Circuit Design
Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.
Sequential Circuit Analysis. 2 Synchronous vs. Asynch. Synchronous sequential circuit:  The behavior can be defined from knowledge of its signal at discrete.
Sequential Circuit Analysis. 2 Synchronous vs. Asynch. Synchronous sequential circuit:  the behavior can be defined from knowledge of its signal at discrete.
A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.
Digital Logic Design Lecture 26. Announcements Exams will be returned on Thursday Final small quiz on Monday, 12/8. Final homework will be assigned Thursday,
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.
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
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.
IKI c-Synthesis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: Prof. Daniel Gajski’s transparency.
Digital Computer Design Fundamental
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
L5 – Sequential Circuit Design
Chapter 5 - Part Sequential Circuit Design Design Procedure  Specification  Formulation - Obtain a state diagram or state table  State Assignment.
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 =
Chap 4. Sequential Circuits
State Machines.
Lecture 4 – State Machine Design 9/26/20081ECE Lecture 4.
Introduction to Sequential Circuit By : Pn Siti Nor Diana Ismail CHAPTER 5.
Moore machine and Mealy machine (P.274)
Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.
Introduction to Sequential Logic Design Finite State-Machine Design.
1 Lecture #12 EGR 277 – Digital Logic Synchronous Logic Circuits versus Combinational Logic Circuits A) Combinational Logic Circuits Recall that there.
CPEN Digital System Design Chapter 5 - Sequential Circuits Sequential Circuit Design C. Gerousis © Logic and Computer Design Fundamentals, 4 rd Ed.,
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
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,
2017/4/24 1.
1 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
CHAPTER 6 Sequential Circuits’ Analysis CHAPTER 6 Sequential Circuits’ Analysis Sichuan University Software College.
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.
CEC 220 Digital Circuit Design Timing Analysis of State Machines
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.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
Synthesis Synchronous Sequential Circuits synthesis procedure –Word description of problem /hardest; art, not science/ –Derive state diagram & state table.
Introduction to Sequential Logic Design Finite State-Machine Analysis.
State Machine Design Shiva choudhary En No.: Electronics and comm. Dept K.I.T.,Jamnagar 1.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.
1 Lecture #15 EGR 277 – Digital Logic Reading Assignment: Chapter 5 in Digital Design, 3 rd Edition by Mano Example: (Problem 5-17 from Digital Design,
Introduction to Sequential Logic Design
ANALYSIS OF SEQUENTIAL CIRCUITS
Mealy Machine x X1 X2 S S1 S2 S3 x X1 X2 S S1 Y1 Y2 S2 Y3 S3 outputs
Lab. on Finite State Machine
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
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.
Relations vs. Functions Function Notation, & Evaluation
L11 – Midterm Review.
SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.
Copyright Joanne DeGroat, ECE, OSU
Presentation transcript:

Sichuan University Software College CHAPTER 6 Sequential Circuits’ Analysis Sichuan University Software College

Mealy Vs Moore machines Mealy model: Both outputs and next state depend both on primary inputs AND present state. Moore model: Only next state depends directly on primary inputs AND present state. Outputs depend only on present state.

Mealy Vs Moore machines Moore sequential circuit model Mealy sequential circuit model

State Machine Notation Impute variable Output variable State variable Excitation variable State State variables and states are related by the expression: 2x=y State variables states

State Diagram Graphical representation of a state table. Graph node with label s denotes state s Graph edge with label X denotes transition between two states when input X is applied S X

State Diagram of Mealy model 0/0 1/0 I/O 01 S1 S2 00 0/1 Reads as: When at state s1 and apply input I, we get output O and proceed to state s2. 0/1 0/1 1/0 10 1/0 11 1/0

State Diagram of Moore model 00,11 S1/O1 S2/O2 01,10 0/0 1/1 Reads as: When at state s1 with output O1 and apply input I, we proceed to state s2 with Output O2. 01,10 00,11

State Diagram

State Table Enumerates the relationship between inputs, outputs, and states of the sequential circuit. State Table

State Table State Table

Transition Table Each state is assigned a unique code. Transition Table for state machine M1

Transition Table Transition Table for state machine M1

Excitation Table and Equations D flip-flop used to realize circuit (two D flip-flops) Transition Table for state machine M1 state machine M1 excitation table using D flip-flops

Excitation Table and Equations DA K-Map DB K-Map Z K-Map DA=f(FA,FB,x,y)=Σ(5,7,10,13,15)=FAFB’xy’+FAx’y+FBy DB=f(FA,FB,x,y)=Σ(2,3,4,5,6,7,14,15)=FA’FB+FA’x+FBx Z= f(FA,FB,x,y)=Σ(11)=FAFB’xy

Excitation Table and Equations T flip-flop used to realize circuit (two T flip-flops) Transition Table for state machine M1

Excitation Table and Equations TB K-Map TA K-Map TA=f(FA,FB,x,y)=Σ(5,7,8,11,12,14)=FAFB’xy+FAx’y’+FAFBy’+FA’FBy TB=f(FA,FB,x,y)=Σ(2,3,12,13)=FA’FB’x+FAFBx’

Excitation Table and Equations S-R flip-flop used to realize circuit (two SR flip-flops) Transition Table for state machine M1 state machine M1 excitation table using S-R flip-flops

Excitation Table and Equations SA K-Map RA K-Map SB K-Map RB K-Map SA=f(FA,FB,x,y)=Σ(5,7) +Σd(9,10,13,15) =FBy RA=f(FA,FB,x,y)=Σ(8,11,12,14) +Σd(0,1,2,3,4,6) =FB’xy+x’y’+FBy’ SB=f(FA,FB,x,y)=Σ(2,3) +Σd(4,5,6,7,14,15) =FA’x RB=f(FA,FB,x,y)=Σ(12,13) +Σd(0,1,8,9,10,11) =FAx’

Excitation Table and Equations J-K flip-flop used to realize circuit (two J-K flip-flops) Transition Table for state machine M1 state machine M1 excitation table using J-K flip-flops

Excitation Table and Equations JA K-Map KA K-Map JB K-Map KB K-Map JA=f(FA,FB,x,y)=Σ(5,7) +Σd(8,9,10,11,12,13,14,15) =FBy KA=f(FA,FB,x,y)=Σ(8,11,12,14) +Σd(0,1,2,3,4,6,7) =FB’xy+x’y’+FBy’ JB=f(FA,FB,x,y)=Σ(2,3) +Σd(4,5,6,7,12,13,14,15) =FA’x KB=f(FA,FB,x,y)=Σ(12,13) +Σd(0,1,2,3,8,9,10,11) =FAx’

Excitation Realization Cost JA=FBy KA=FB’xy+x’y’+FBy’ JB=FA’x KB=FAx’

Excitation Realization Cost SA=FBy RA=FB’xy+x’y’+FBy’ SB=FA’x RB=FAx’

Excitation Realization Cost TA=FAFB’xy+FAx’y’+FAFBy’+FA’FBy TB=FA’FB’x+FAFBx’

Excitation Realization Cost DA=FAFB’xy’+FAx’y+FBy DB=FA’FB+FA’x+FBx

Excitation Realization Cost Y Z Z= FAFB’xy

TO BE CONTINUED