+ All Categories
Home > Documents > Digital Design Lecture 10

Digital Design Lecture 10

Date post: 06-Feb-2016
Category:
Upload: ave
View: 29 times
Download: 3 times
Share this document with a friend
Description:
Digital Design Lecture 10. Sequential Design. State Reduction. Equivalent Circuits Identical input sequence Identical output sequence Equivalent States Same input  same output Same input  same or equivalent next state. Next State x=0 x=1 a b c d a d e f a f - PowerPoint PPT Presentation
Popular Tags:
18
Digital Design Lecture 10 Sequential Design
Transcript
Page 1: Digital Design Lecture 10

Digital DesignLecture 10

Sequential Design

Page 2: Digital Design Lecture 10

State Reduction

• Equivalent Circuits– Identical input sequence– Identical output sequence

• Equivalent States– Same input same output– Same input same or

equivalent next state

Page 3: Digital Design Lecture 10

• g & e equivalent, f & d equivalent

State

a

b

c

d

e

f

g

Next Statex=0 x=1

a b

c d

a d

e f

a f

g f

a f

Outputx=0 x=1

0 0

0 0

0 0

0 1

0 1

0 1

0 1

Page 4: Digital Design Lecture 10

State Assignment

Stateabcde

Binary000001010011100

Gray Code000001011010110

One-Hot0000100010001000100010000

Page 5: Digital Design Lecture 10

Reduced State Table:Binary State Assignment

State

001

010

011

100

101

Next Statex=0 x=1

000 001

010 011

000 011

100 011

000 011

Outputx=0 x=1

0 0

0 0

0 0

0 1

0 1

Table 5-10

Page 6: Digital Design Lecture 10

Design Procedure

• Develop State Diagram From Specs

• Reduce States

• Assign Binary values to States

• Write Binary-coded State Table

• Choose Flip-Flops

• Derive Input and Output Equations

• Draw the Logic Diagram

Page 7: Digital Design Lecture 10

Develop State Diagram:Sequence Detector

• Detect 3 or more 1s in sequence (a Moore Model)

Page 8: Digital Design Lecture 10

D Flip-Flop Input Equations

A(t+1) = DA(A,B,x) = (3,5,7) B(t+1) = DB(A,B,x) = (1,5,7)

y(A,B,x) = (6,7)

StateA B

0 00 00 10 11 01 01 11 1

Next StateA B

0 00 10 01 00 01 10 01 1

Output y

0 0 0 00011

Input x

0 1 0 10101

Input equations come directly from the next state in D Flip-Flop design

Page 9: Digital Design Lecture 10

Simplified Boolean Equations

Page 10: Digital Design Lecture 10

Sequence Detector: D Flip-Flops

Page 11: Digital Design Lecture 10

Using JK or T Flip-Flops

1. Develop Excitation Table Using Excitation Tables

Table 5-12

K

XX10

J

01XX

Q(t+1)

0 1 0 1

JK Flip-Flop

Q(t)

0 0 1 1

T

0110

T Flip-Flop

Q(t+1)

0 1 0 1

Q(t)

0 0 1 1

Page 12: Digital Design Lecture 10

State Table: JK Flip-Flop Inputs

B

00110011

A

00001111

PresentState

x

00001111

Input

B

01010110

A

00101110

NextState

KA

01010110

JA

00101110

KB

01010110

JB

00101110

Flip-Flop Inputs

Table 5-13

Page 13: Digital Design Lecture 10

Maps for J and K Input Equations

Page 14: Digital Design Lecture 10

JK Flip-Flop Sequence Detector

Page 15: Digital Design Lecture 10

Synthesis Using T Flip-Flops:Designing a Counter

Page 16: Digital Design Lecture 10

3-Bit Counter State Table

A1

00110011

A2

00001111

Present State

A0

01010101

A1

01100110

A2

00011110

TA1

01010111

TA2

00010001

TA0

11111111

Flip-Flop InputsNext State

A0

10101010

Page 17: Digital Design Lecture 10

3-Bit Counter Karnaugh Maps

Page 18: Digital Design Lecture 10

The 3-Bit Counter


Recommended