Exercises 8 (23 pts)

For the following state table:

PS|   INPUT
| x=0 x=1   A| B,a F,b
B| C,a A,c
C| D,a B,b
D| E,b C,c
E| F,b F,b
F| A,c E,c
|   NS,z

a) (3 pts) Give a binary encoding for D-FF (see page 213) of:

output functions
state code
state-transition table

b) (3 pt) Obtain Karnaugh maps for the next state inputs to a D-FF architecture.
c) (3 pt) From Karnaugh maps, obtain the simplified next state expressions.
d) (3 pt) Give the state transition table and outputs for a multiplexer architecture with D-FF.
e) (3 pt) Obtain multiplexer inputs for next state to a D-FF architecture.
f) (2 pt) Give the Karnaugh maps for the output of multiplexer architecture.
g) (4 pt) Give the transition table and output for the one-hot architecture.
h) (2 pt) Obtain the expressions for the output for the one-hot architecture.