Download presentation

Published byCordell Race Modified over 4 years ago

1
**COE 202: Digital Logic Design Sequential Circuits Part 2**

Courtesy of Dr. Ahmad Almulhem KFUPM

2
**Objectives Analysis of Synchronous Sequential Circuits Procedure**

Examples KFUPM

3
**Analysis of Sequential Circuits**

Analysis is describing what a given circuit will do The behavior of a clocked (synchronous) sequential circuit is determined from the inputs, the output, and the states of FF Steps: Obtain state equations FF input equations Output equations Fill the state table Put all combinations of inputs and current states Fill the next state and output Draw the state diagram KFUPM

4
**Analysis of Combinational vs Sequential Circuits**

Boolean Equations Truth Table Output as a function of inputs Sequential : State Equations State Table State Diagram Output as a function of input and current state Next state as a function of inputs and current state. KFUPM

5
State Equations A state equation is a Boolean expression which specifies the next state and output as a function of the present state and inputs. Example: The shown circuit has two D-FFs (A,B), an input x and output y. The D input of a FF determines the next state A(t+1) = A(t)x+B(t)x = Ax+Bx B(t+1) = A’(t)x = A’x Output: y = (A+B)x’ KFUPM

6
State Table A state table is a table enumerating all present states, inputs, next states and outputs. Present state, inputs: list all combinations Next states, outputs: derived from state equations 4 sections KFUPM

7
State Table A state table is a table enumerating all present states, inputs, next states and outputs. Present state, inputs: list all combinations Next states, outputs: derived from state equations 2-D Form KFUPM

8
State Diagram The state diagram is a graphical representation of a state table (provides same information) Circles are states (FFs), Arrows are transitions between states Labels of arrows represent inputs and outputs KFUPM

9
**Analysis of Sequential Circuits**

Analysis is describing what a given circuit will do The behavior of a clocked (synchronous) sequential circuit is determined from the inputs, the output, and the states of FF Steps: Obtain state equations FF input equations Output equations Fill the state table Put all combinations of inputs and current states Fill the next state and output Draw the state diagram KFUPM

10
**Example 1 Analyze this circuit? Is this a sequential circuit? Why?**

How many inputs? How many outputs? How many states? What type of memory? KFUPM

11
**Example 1 (cont.) D Flip Flop (review)**

Characteristic Tables and Equations Q(t) D Q(t+1) 1 D Q(t+1) 1 Q(t+1) = D KFUPM

12
Example 1 (cont.) KFUPM

13
Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ KFUPM

14
Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ State table: KFUPM

15
Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ State table (2D): KFUPM

16
Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ State table: State diagram: KFUPM

17
**Example 2 Analyze this circuit. What about the output?**

This circuit is an example of a Moore machine (output depends only on current state) Mealy machines is the other type (output depends on inputs and current states) KFUPM

18
Example 2 (cont.) Equation: DA = A X Y KFUPM

19
Example 2 (cont.) Equation: DA = A X Y KFUPM

20
**Example 3 Analyze this circuit? Is this a sequential circuit? Why?**

How many inputs? How many outputs? How many states? What type of memory? KFUPM

21
**Example 3 (cont.) Q(t+1) = JQ’ + K’Q JK Flip Flop (review)**

Characteristic Tables and Equations J K Q(t+1) Q(t) 1 Q’(t) Q(t+1) = JQ’ + K’Q KFUPM

22
Example 3 (cont.) KFUPM

23
Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ KFUPM

24
Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ KFUPM

25
Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ KFUPM

26
**Example 4 Analyze this circuit? Is this a sequential circuit? Why?**

How many inputs? How many outputs? How many states? What type of memory? KFUPM

27
Example 4 (cont.) State equations: JA = BX’ KA = BX’ + B’X DB = X Y = X’AB by substitution: A(t+1) = JAA’ + KA’A KFUPM

28
Example 4 (cont.) State equations: JA = BX’ KA = BX’ + B’X DB = X Y = X’AB by substitution: A(t+1) = JAA’ + KA’A Current State Input Next State Output A(t) B(t) X A(t+1) B(t+1) Y 1 KFUPM

29
**Example 5 Analyze this circuit? Is this a sequential circuit? Why?**

How many inputs? How many outputs? How many states? What type of memory? KFUPM

30
**Example 5 (cont.) Q(t+1) = TQ’ + T’Q T Flip Flop (review)**

Characteristic Tables and Equations T Q(t+1) Q(t) 1 Q’(t) Q(t+1) = TQ’ + T’Q KFUPM

31
Example 5 (cont.) KFUPM

32
Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A KFUPM

33
Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A KFUPM

34
**What does this circuit do?**

Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A The output depends only on current state. This is a Moore machine What does this circuit do? KFUPM

35
**Mealy vs Moore Finite State Machine (FSM)**

Mealy FSM: Output depends on current state and input Output is not synchronized with the clock Moore FSM: Output depends on current state only KFUPM

36
**Summary To analyze a sequential circuit:**

Obtain state equations FF input equations Output equations Fill the state table Put all combinations of inputs and current states Fill the next state and output For the next state use characteristic table/equation Draw the state diagram Two types of synchronous sequential circuits (Mealy and Moore) KFUPM

Similar presentations

OK

ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)

ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)

© 2018 SlidePlayer.com Inc.

All rights reserved.

To ensure the functioning of the site, we use **cookies**. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy & Terms.
Your consent to our cookies if you continue to use this website.

Ads by Google

Read ppt on iphone Ppt on series and parallel circuits problems Maths ppt on surface area and volume class 9 Ppt on social contract theory definition Ppt on conservation of electrical energy Friction for kids ppt on batteries Ppt on seasons in hindi Ppt on google company profile Ppt on forest and wildlife resources in india Ppt on corporate etiquettes of life