Question

Let’s look at a simple state machine with the input signal, w, represents a toggle switch for a flashlight that has two modes: blink once or stay on. And the output, z, represents the light being on. To get the light to blink once (i.e, have z assert for one cycle), w needs to assert for just one cycle. To get the light to stay on (i.e., have z stay asserted), w needs to assert for two consecutive cycles. After that, it will stay on (i.e., z will stay asserted) while w is de-asserted. When w asserts again, the light will be turned off (i.e., z will de-assert).

Create a 1-hot implementation of the traffic light state machine from this problem:

(a) Create the state table with state assignments, showing the next states as a function of the input and the outputs as a function of the present state.

(b) Determine the logic equations for the next state inputs to the flops, and for the six output control signals.

Answer 1

liaht 브ink once, stau onordOF ate oup Oulpul ala state rachipe eC ies SD light' 21面 blink once 01 riealau stae Machine Reset ω 0100 S2. state table Cunent stale Nxt stae autput SO 51 54 S2 S2 O o 50 52.

state assiqnmenb tabie Cluvient Next 01 0 1 0 o Excitation table of a Jk ㆁ소

ko -1 Lu Jk CIK. -a