Question $10$

$40$ pts

Design a counter that starts at $6$ then counts to $5$ then counts to $0$ then counts to $1$ then counts to $3$ then counts to $4$ and then counts to $2.$ Once it reaches $2$ the counter returns to $6$ and continues counting in the same manner.

Additionally, it must be implemented using $JK-$flipflops, and answer the following:

Draw the transition graph for the counter

Draw the proper truth table for the present state and next state

Draw and fill the proper $k-$map$(s)$ with all the labels for the next state.

Show the proper grouping in your $k-$map$($s$)$ and find the optimal $($ minimal$)$ Sops for the next state.

Draw the proper truth table for the logic to be connected to each flip flop

Draw and fill the proper $k-$map$($s$)$ with all the labels for the logic to be connected to each flip flop.

Show the proper grouping in your $k-$map$($s$)$ and find the optimal $($minimal$)$ SoPs for the logic to be connected to each flip flop.

Draw the logic design of the counter and show the points where you would check the count.

What is the trigger in your design for the counter to go to the next value? Explain.

What machine did you just implement?

Upload