Good on Analysis of Sequential Logic Circut

17
Ch5 Analysis of SC. 1 ANALYSIS OF SEQUENTIAL CIRCUITS Given a sequential circuit diagram, we can analyze its behavior by deriving its state table and hence its state diagram. • Requires state equations to be derived for the flip-flop inputs, as well as output functions for the circuit outputs other than the flip-flops (if any). A(t) and A(t+1) will be used to represent the present state and next state, respectively, of a flip-flop with output A.

description

fdsdfhp

Transcript of Good on Analysis of Sequential Logic Circut

Page 1: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 1

ANALYSIS OF SEQUENTIAL CIRCUITS

• Given a sequential circuit diagram, we can analyze its behavior by deriving its state tableand hence its state diagram.

• Requires state equations to be derived for the flip-flop inputs, as well as output functions for the circuit outputs other than the flip-flops (if any).

• A(t) and A(t+1) will be used to represent the present state and next state, respectively, of a flip-flop with output A.

Page 2: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 2

ANALYSIS OF SEQUENTIAL CIRCUITS

• Example using D flip-flops

State equations:A(t+1) = A(t)·x(t) + B(t)·x(t)B(t+1) = A‘(t)·x(t)

Output function:y(t) = [A(t) + B(t)]·x‘(t)

A

A'

B

B'

y

x

CLK

D Q

Q'

D Q

Q'

Fig. 5-15

Or simply as:A(t+1) = A·x + B·xB(t+1) = A‘·x

Output function:y(t) = (A + B)·x‘

A state Equation or (Transition Equation)Specifies the next state as function of the present state and inputs

Page 3: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 3

ANALYSIS OF SEQUENTIAL CIRCUITS

• From the state equations and output function, we derive the state table , consisting of all possible binary combinations of present states and inputs.

• State table– Similar to truth table.– Inputs and present state on the left side.– Outputs and next state on the right side.

• m flip-flops and n inputs → 2m+n rows.

Page 4: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 4

ANALYSIS OF SEQUENTIAL CIRCUITS• State table for circuit of Fig. 5-15

State equations:A(t+1) = A·x + B·xB(t+1) = A'·x

Output function:y = (A + B)·x'

Present Next State Input State Output A B x A B y

0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0

The Next state and output columns are derived from the state equations

Table 5-2

Page 5: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 5

ANALYSIS OF SEQUENTIAL CIRCUITS

• Compact form of state table:

Present Next State Output State x=0 x=1 x=0 x=1 AB AB AB y y

00 00 01 0 0 01 00 11 1 0 10 00 10 1 0 11 00 10 1 0

Table 5-3: Second Form of

State Table

Present Next State Input State Output A B x A B y

0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0

Only 3 Sections: Present state, Next state and Output.The input conditons are enumerated under the next state and output sections

Page 6: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 6

ANALYSIS OF SEQUENTIAL CIRCUITS• State diagram is drawn from the state table• Each combination of the flip-flop values represents

a state. Hence, m flip-flops → up to 2m states• State diagram

Each state is denoted by a circle.Each arrow (between two circles) denotes a transition of

the sequential circuit (a row in state table).A label of the form a/b is attached to each arrow where a

(if there is one) denotes the inputs while b (if there is one) denotes the outputs of the circuit in that transition.

0010

1/0

1/1

Page 7: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 7

ANALYSIS OF SEQUENTIAL CIRCUITS

• State diagram of the circuit of Fig.5-15

Present Next State Output State x=0 x=1 x=0 x=1 AB AB AB y y

00 00 01 0 0 01 00 11 1 0 10 00 10 1 0 11 00 10 1 0

00

01 11

101/0

1/0

1/0

0/1

0/10/0

1/0 0/1

Provide the same information as the state table (5-2) or table (5-3)

No difference between State table and State diagram except in the manner of representation

Page 8: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 8

FLIP-FLOP INPUT FUNCTIONS• The outputs of a sequential circuit are functions of

the present states of the flip-flops and the inputs. These are described algebraically by the circuit output functions. In Fig5-15: y = (A + B)·x'

• The part of the circuit that generates inputs to the flip-flops are described algebraically by the flip-flop input functions (or flip-flop excitation equations).

• The flip-flop input functions determine the next state generation.

• From the flip-flop input functions and the characteristic tables of the flip-flops, we obtain the next states of the flip-flops.

Page 9: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 9

FLIP-FLOP INPUT FUNCTIONS

• Example1: Determine

the input function of

the JK flip-flop shown below?.

• Normally a letter with subscript is used to denote each flip-flop input: the letter denotes the input of the flip-flop (J or K for J-K flip-flop, D for D flip-flop, Tfor T flip-flop) and the subscript letter denotes the name of the flip-flop output.

A

BC'x

By

CP

J Q

Q'K

B'Cx'

JA = B·C'·x + B'·C·x'KA = B + y

Page 10: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 10

FLIP-FLOP INPUT FUNCTIONS• Example2: In Figure below obtain the excitation

function DA, DB and the state equations?

A

A'

B

B'

y

x

CP

D Q

Q'

D Q

Q'

The input functions to the Flip-Flops can be obtained directly from the circuit as:

DA = A·x + B ·xDB = A' ·x

And since for D Flip-Flop the output is equal to the input data therefore: A(t+1) = A·x + B·xB(t+1) = A'·x

Page 11: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 11

ANALYSIS WITH JK FLIP-FLOP• Example 1: Given Fig. 5-18, a sequential circuit with

two J-K flip-flops A and B, and one input x.

A

B

x

CP

J Q

Q'K

J Q

Q'KFig. 5-18

• Obtain the flip-flop input functions from the circuit:JA = B JB = x'KA = B·x' K B = A' ·x + A ·x' = A ⊕⊕⊕⊕ x

Page 12: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 12

ANALYSIS WITH JK FLIP-FLOPJA = B JB = x'KA = B·x' K B = A' ·x + A ·x' = A ⊕⊕⊕⊕ x

• Example2: Fill the state table using the above functions, knowing the characteristics of the flip-flops used.

Present Next state Input state Flip-flop inputs

A B x A B JA KA JB KB

0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 1 0 1 1 1 1 1 1 1 1 0 0 0

J K Q(t+1) Comments

0 0 Q(t) No change0 1 0 Reset1 0 1 Set1 1 Q(t)' Toggle

Page 13: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 13

ANALYSIS WITH JK FLIP-FLOP• Draw the state diagram from the state table.

Present Next state Input state Flip-flop inputs

A B x A B JA KA JB KB

0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 1 0 1 1 1 1 1 1 1 1 0 0 0

Page 14: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 14

Problem• Derive the input functions &

• Derive the state table and state diagram of this circuit.

J Q

Q'K

J Q

Q'K

A

x

CP

B

y

Page 15: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 15

FLIP-FLOP EXCITATION TABLES

• Analysis: Starting from a circuit diagram, derive the state table or state diagram.

• Design: Starting from a set of specifications (in the form of state equations, state table, or state diagram), derive the logic circuit.

• Characteristic tables are used in analysis.

• Excitation tables are used in design.

Page 16: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 16

FLIP-FLOP EXCITATION TABLES

• Excitation tables: given the required transition from present state to next state, determine the flip-flop inputs. Q Q(t+1) J K

0 0 0 X 0 1 1 X 1 0 X 11 1 X 0

D Flip-flop

Q Q(t+1) D

0 0 0 0 1 1 1 0 0 1 1 1

T Flip-flop

Q Q(t+1) T

0 0 0 0 1 1 1 0 1 1 1 0

JK Flip-flop

Page 17: Good on Analysis of Sequential Logic Circut

Ch5 Analysis of SC. 17

FLIP-FLOP CHARACTERISTIC TABLES

• Each type of flip-flop has its own behavior, shown by its characteristic table.

J K Q(t+1) Comments

0 0 Q(t) No change0 1 0 Reset1 0 1 Set1 1 Q(t)' Toggle

T Q(t+1)

0 Q(t) No change1 Q(t)' Toggle

D Q(t+1)

0 0 Reset1 1 Set