Fall 2004EE 3563 Digital Systems Design EE3563 Chapter 7, 8, 10 Reading Assignments  7.1, 7.2, 7.3  8.1, 8.2.1-8.2.3, 8.2.5  8.4.1-8.4.3  8.5.1, 8.5.2,

Slides:



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

Clocked Synchronous State-machine Analysis
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
A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.
Classification of Digital Circuits  Combinational. Output depends only on current input values.  Sequential. Output depends on current input values and.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.
CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.
Computing Machinery Chapter 5: Sequential Circuits.
Circuits require memory to store intermediate data
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.
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.
ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.
ECE 331 – Digital System Design
1 Sequential logic networks I. Motivation & Examples  Output depends on current input and past history of inputs.  “State” embodies all the information.
1 EE365 Sequential-circuit design Sequential-circuit synthesis.
EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.
5. Choose a flip-flop type for the state memory. ReturnNext 7.4 Clocked Synchronous State-Machine Design 1. Construct a state/output table corresponding.
CS 151 Digital Systems Design Lecture 20 Sequential Circuits: Flip flops.
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.
7.4 Clocked Synchronous State-Machine Analysis
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.
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 =
Synchronous Circuit Design (Class 10.1 – 10/30/2012) CSE 2441 – Introduction to Digital Logic Fall 2012 Instructor – Bill Carroll, Professor of CSE.
Lecture 4 – State Machine Design 9/26/20081ECE Lecture 4.
Introduction to Sequential Logic Design Flip-flops FSM Analysis.
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.
ECE 3130 – Digital Electronics and Design Lab 6 State Machines Fall 2012 Allan Guan.
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
Module : FSM Topic : types of FSM. Two types of FSM The instant of transition from the present to the next can be completely controlled by a clock; additionally,
Synchronous Counters Synchronous digital counters have a common clock which results in all the flip-flops being triggered simultaneously. Consequently,
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.
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
1 Lecture #11 EGR 277 – Digital Logic Ch. 5 - Synchronous Sequential Logic There are two primary classifications of logic circuits: 1.Combinational logic.
Sequential Design Motivation Sequential processing often more tractable than parallel Example Sequential processing sometimes only method that works Example.
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
A sequential logic circuit (a.k.a. state machine) consists of both combinational logic circuit(s) and memory devices (flip flops). The combinational circuits.
Synchronous Counter Design
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.
Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.
1 Clocked synchronous seq. circuits A.k.a. “state machines” Use edge-triggered flip-flops All flip-flops are triggered from the same master clock signal,
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.
Lecture #17: Clocked Synchronous State-Machine Analysis
Week #7 Sequential Circuits (Part B)
Introduction to Sequential Logic Design
ANALYSIS OF SEQUENTIAL CIRCUITS
Sequential logic design principles
Introduction to Advanced Digital Design (14 Marks)
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.
FINITE STATE MACHINES (FSMs)
Sequential logic circuits
CSE 140L Discussion Finite State Machines.
ECE 3130 – Digital Electronics and Design
SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.
FINITE STATE MACHINES.
Presentation transcript:

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,  8.8  10.1, 10.2, , ,

Fall 2004EE 3563 Digital Systems Design EE3563 Revisit Transfer Curve

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  A state machine has several components: –Next-State Logic Combinational logic that determines what the next state should be –State Memory Value of output of flip flops –Output Logic Flip flop output is not necessarily the final output For example, output might be the ANDing of the flip-flop output  Clocked means that transitions only happen on the tick of a clock  Synchronous means that all transitions happen at the same time – the tick of the clock  There are 2 n distinct states with n being the number of binary state variables

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Mealy machine – output logic takes as input the current state as well as the machine inputs

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Moore machine – output logic is solely based upon the current state  If some outputs depend on inputs and some don’t, then it is classified as a Mealy machine

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Outputs may be pipelined as well, that is, the final outputs depend upon the state and inputs of the previous clock period  Pipelining can be very efficient, much like an assembly line  When a machine has multiple stages, pipelining can allow each stage to work in parallel thereby increasing efficiency

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  The functional behavior of a latch or flip-flop can be described with a characteristic equation  It specifies the next state as a function of inputs and current state

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  State machine with two positive-edge-triggered D flip-flops

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Transition Table, State Table, State/Output Table

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  State Diagram for D-FF Mealy State Machine

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  State Diagram for D-FF Moore State Machine

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  D-FF State Machine Redrawn

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Steps for analyzing a clocked synchronous circuit: –Get excitation equations –Substitute excitation equations into flip-flop characteristic equations –Use transition equations to construct transition table –Get output equations –Create transition/output table –Name states and substitute state names for state-variable combinations to create state output table –Draw a state diagram corresponding to the state/output table  The text goes through these steps for a different example on pages  We will go through the steps, but using the J-K flip-flop example

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Get Excitation Equations

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Get Excitation Equations

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Substitute excitation equations into flip-flop characteristic equations to get transition equations Characteristic EquationsExcitation Equations Transition Equations

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Use transition equations to construct transition table

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Get output equation

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Get output equation  Z = X * Q0*Q1 + Y*Q0’*Q1’

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Create transition/output table Transition Output Table

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Name states and substitute state names for state-variable combinations to create state output table State Output Table

Fall 2004EE 3563 Digital Systems Design EE 3563 Clocked Synchronous State Machines  Draw a state diagram corresponding to the state/output table