Scribd
Upload
122 views

Hardware Tutorial Solution 05

This document contains solutions to questions from a hardware tutorial on finite state machines. It includes the following: - Truth tables showing the current state and next state for a finite state machine with inputs Q1, Q2, Q3 and states 0, 1, 2, 3, UN, OV. - K-maps showing the minimized logic expressions for the output variables D1, D2, D3 in terms of the inputs Q1, Q2, Q3 and state C1. - An alternative minimal solution for decoding the states in terms of the inputs and new output variables OV, UN.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
122 views

Hardware Tutorial Solution 05

This document contains solutions to questions from a hardware tutorial on finite state machines. It includes the following: - Truth tables showing the current state and next state for a finite state machine with inputs Q1, Q2, Q3 and states 0, 1, 2, 3, UN, OV. - K-maps showing the minimized logic expressions for the output variables D1, D2, D3 in terms of the inputs Q1, Q2, Q3 and state C1. - An alternative minimal solution for decoding the states in terms of the inputs and new output variables OV, UN.

Uploaded by

Taqi Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DOC Course 112: Hardware: Tutorial 5 Solution

Q1.
C1
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

.
Q2.

Q3
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

Q2
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

Q1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

Curr. State
0
1
2
3
UN
don't care
don't care

Next State
2
3
OV
OV
0
don't care
don't care

OV
0
1
2
3
UN
don't care
don't care

OV
UN
UN
0
1
UN
don't care
don't care

OV

10

C1 Q2,Q1
Q3 00 01 11
1
1
00 1

Q3
0
0

Q2 Q1
1
0
1
1

1
1
0

1
1
0

1
1
0

X
X
1
1

X
X
1
0

X
X
1
0

0
0
1

0
0
0

0
1
0

X
X

X
X

X
X

C1 Q2,Q1
Q3
00 01 11
00

01

01

11

11

10

10

D3

10
1

C1 Q2,Q1
Q3
00 01 11

10

00

01

11

10

D2

D3 =

C1'Q2 + C1Q2' = C1<+>Q2

D2 =

C1'Q3' + C1'Q2 = C1'(Q2 + Q3')

<+> = XOR

C1'Q1 + C1'Q2 + Q3'Q2Q1 = C1'(Q1+Q2) + Q3'Q2Q1

D1 =

D1

Q3 The obvious solution is to decode the minterms for the state:


Q1

Q2

OV

Q3
UN

By K-map design we obtain a better solution (NB Other solutions are possible):
Q2,Q1
00
01

Q3

Q2,Q1
00
01

Q3

11

10

11

10

Q3
OV

Q2

OV

UN
UN = Q3Q2'

UN

OV = Q3Q2

Optional:
C1 Q2,Q1
Q3
00 01

11

10

00

01

11

10

Q2,Q1
00 01 11
1
1
00 1

C1
Q3

01

11

10

D3
C1
Q3

10
1

2
1

01

11

10

3
1

0
0

OV

10

00

D2

Q2,Q1
00 01 11

0
1

UN

0
1

D1

DOC112: Hardware Tutorial 5

Page 3

You might also like