1.Reset State: Green light in N-S direction, red in EW direction.

2.When a car is detected in the east-west direction (eastwestwaiting = 1) go through a sequence that makes the light green in the east-west direction and then return to green in the north-south direction.

3.A direction with a green light must first transition to a state where the light is yellow before going to a state where the light goes red.

4.A direction can have a green light only if the light in the other direction is red.

The state transition table is given as follows (Reset is notshown. ) :

A) Name the states using binary encoding

B) Create the truth table for next state logic and calculate the combinational Boolean logic statements.

C) Create the truth table for output logic and calculate the combinational Boolean logic statements.

D) Draw the curcuit diagram .

E) Implement the fsm in verilog.

ar detector Car Detector eastwestwaiting rst cik S Problem 1 (40) The traffic lights: Design a finite state machine to control the traffic lights at an intersection of a north-south road with an east-west road. The spefications are as follows: There are six lights to control green, yellow, and red for the north-south road, and for the east-west road. input signal eastwestwaiting that indicates that a car is waiting on the east-west road. A second input, rst, resets the FSM to a known state. The procedure of the lights are as follows: rst eastwestwaiting gns yns gew yew 100 001 010 001 001 100 001 010 state output gyr gyr ns ew