Prob 4. Design a clocked synchronous finite state machine with the state/output tat shown in the Table below using D flip-flops. Use two state variables Q1 and Q2 wit state assignment A=(Q1,Q2)=00, B=01,C=11 and D=10. The machine has two inpu X2 such that when X1,X2 = 00, the machine transitions in the sequence A,B,C,D,A. when X1,X2 = 01, the machine transitions in the sequence D,C,B,A,D and when XI = 11, the machine transitions in the sequence, A,B,D,C,A. The input X1,X2 = 10 is used. Its state table and output Z is shown below. X= don't care. Input X1,X2 Next State Q1,Q2 Present State Output Z Q1,Q2 A 00 В 1 A 01 D 1 A 10 X A 11 В В 00 C 1 В 01 A 1 В 10 X X В 11 D 00 A 1 D 01 C 1 D 10 X D 11 C 00 D 1 01 В 1 C 10 X X C 11 A

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
Prob 4. Design a clocked synchronous finite state machine with the state/output table
shown in the Table below using D flip-flops. Use two state variables Q1 and Q2 with the
state assignment A=(Q1,Q2)=00, B=01,C=11 and D=10. The machine has two inputs X1,
X2 such that when X1,X2 = 00, the machine transitions in the sequence A,B,C,D,A,
when X1,X2 = 01, the machine transitions in the sequence D,C,B,A,D and when X1, X2
= 11, the machine transitions in the sequence, A,B,D,C,A. The input X1,X2 = 10 is never
used. Its state table and output Z is shown below. X= don’t care.
Present State Input X1,X2 Next State
Q1,Q2
Output Z
Q1,Q2
A
00
B
1
А
01
D
1
А
10
X
X
A
11
В
В
00
C
1
В
01
A
1
В
10
X
В
11
D
D
00
A
1
D
01
1
10
X
X
11
C
C
00
D
1
C
01
В
1
C
10
X
C
11
A
Transcribed Image Text:Prob 4. Design a clocked synchronous finite state machine with the state/output table shown in the Table below using D flip-flops. Use two state variables Q1 and Q2 with the state assignment A=(Q1,Q2)=00, B=01,C=11 and D=10. The machine has two inputs X1, X2 such that when X1,X2 = 00, the machine transitions in the sequence A,B,C,D,A, when X1,X2 = 01, the machine transitions in the sequence D,C,B,A,D and when X1, X2 = 11, the machine transitions in the sequence, A,B,D,C,A. The input X1,X2 = 10 is never used. Its state table and output Z is shown below. X= don’t care. Present State Input X1,X2 Next State Q1,Q2 Output Z Q1,Q2 A 00 B 1 А 01 D 1 А 10 X X A 11 В В 00 C 1 В 01 A 1 В 10 X В 11 D D 00 A 1 D 01 1 10 X X 11 C C 00 D 1 C 01 В 1 C 10 X C 11 A
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY