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.

Slides:

Advertisements

Similar presentations

COE 202: Digital Logic Design Sequential Circuits Part 2

Advertisements

State-machine structure (Mealy)

A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.

ECE 331 – Digital System Design Latches and Flip-Flops (Lecture #17) The slides included herein were taken from the materials accompanying Fundamentals.

Computer Architecture CS 215

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.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.

1 EE121 John Wakerly Lecture #10 Some shift-register stuff Sequential-circuit analysis.

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.

EECC341 - Shaaban #1 Lec # 13 Winter Sequential Logic Circuits Unlike combinational logic circuits, the output of sequential logic circuits.

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.

11/10/2004EE 42 fall 2004 lecture 301 Lecture #30 Finite State Machines Last lecture: –CMOS fabrication –Clocked and latched circuits This lecture: –Finite.

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.

7.4 Clocked Synchronous State-Machine Analysis

Digital Computer Design Fundamental

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 =

Circuit, State Diagram, State Table

Chap 4. Sequential Circuits

Sequential Circuits. Combinational Circuits + Storage element output depends both on previous state and input Fig. 5-1.

Sequential Logic Materials taken from: Digital Design and Computer Architecture by David and Sarah Harris & The Essentials of Computer Organization and.

Synchronous Sequential Logic Chapter 5. Digital Circuits Sequential Circuits Combinational circuits contains no memory elements the outputs depends.

Chap 4. Sequential Circuits

Lecture 4 – State Machine Design 9/26/20081ECE Lecture 4.

Introduction to Sequential Circuit By : Pn Siti Nor Diana Ismail CHAPTER 5.

Introduction to Sequential Logic Design Flip-flops FSM Analysis.

Introduction to Sequential Logic Design Finite State-Machine Design.

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,

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,

EE121 John Wakerly Lecture #11

FINITE STATE MACHINES (FSMs)

Introduction to Sequential Logic Design Bistable elements.

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.

Registers; State Machines Analysis Section 7-1 Section 5-4.

1 COMP541 Sequential Circuits Montek Singh Feb 1, 2007.

Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.

Synchronous Sequential Logic Part I

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

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.

Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #3 Flip-Flops, Registers, Shift registers, Counters, Memory 3/3/2005.

Memory Elements. Outline  Introduction  Memory elements.

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

Introduction to Sequential Logic Design

ANALYSIS OF SEQUENTIAL CIRCUITS

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and so on require.

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.

Reference: Chapter 5 Sequential Circuits Moris Mano 4th Ediditon

FINITE STATE MACHINES.

Chapter 5 Sequential Circuits.

SEQUENTIAL CIRCUITS __________________________________________________

Presentation transcript:

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 from the same master clock signal, and therefore all change state together Feedback sequential circuits –No explicit flip-flops; state stored in feedback loops –Example: edge-triggered D flip-flop itself (4 states) –Sections 7.9, 7.10 (advanced courses)

3 State-machine structure (Mealy) typically edge-triggered D flip-flops output depends on state and input

4 State-machine structure (Moore) output depends on state only typically edge-triggered D flip-flops

5 State-machine structure (pipelined) Often used in PLD-based state machines. –Outputs taken directly from flip-flops, valid sooner after clock edge. –But the “output logic” must determine output value one clock tick sooner (“pipelined”).

6 Notation, characteristic equations Q  means “the next value of Q.” “Excitation” is the input applied to a device that determines the next state. “Characteristic equation” specifies the next state of a device as a function of its excitation. S-R latch: Q  = S + R´ · Q Edge-triggered D flip-flop: Q  = D

7 State-machine analysis steps Assumption: Starting point is a logic diagram. 1. Determine next-state function F and output function G. 2a. Construct state table –For each state/input combination, determine the excitation value. –Using the characteristic equation, determine the corresponding next-state values (trivial with D f-f’s). 2b. Construct output table –For each state/input combination, determine the output value. (Can be combined with state table.) 3. (Optional) Draw state diagram

8 Example state machine

9 Excitation equations

10 Transition equations Excitation equations Characteristic equations Substitute excitation equations into characteristic equations

11 Transition and state tables transition table state table state/output table (transition equations) (output equation)

12 State diagram Circles for states Arrows for transitions (note output info)

13 Modified state machine Moore machine MAXS = Q0  Q1 MAXS

14 Updated state/output table, state diagram

15 Timing diagram for state machine Not a complete description of machine behavior