Solve the Following Problem: A Traffic Light Controller for the one-way (half-duplex) Paradise Bridge

Paradise is a town in Saint Andrew's Parish, Grenada. It is located in the east of the island, between Grenville and Dunfermline. The French built this Georgian-style stone bridge with three arches, in the 1800s. It is the only bridge with its own traffic light to regulate its one-way at a time traffic.

You are to design a Finite State Machine that regulates the traffic though this one-way at a time bridge.

At each extreme of the bridge there is a two-lane road that gets squeezed when cars have to traverse the bridge. To maximize the throughput cars are allowed to cross the bridge in groups. To create this car-groups at both extremes of the bridge there are car-queues that serve to bunch together all the cars that will be allowed to cross the bridge as a group in either direction. There is a traffic light allowing traffic to enter the car-queues and there is a second traffic light that allows releasing the cars from the car-queues into the Paradise Bridge.

Your FSM design will control four stop-lights, two on each side of the Paradise Bridge. These two lights on each end, are used for letting cars into the Car-queue and from the Car-queue into the corresponding side of the bridge.

By default both stop-lights into the bridge are red, so that it is not possible to cross the bridge without your state machine coordinates the sequencing of these lights.

To begin, your FSM should make sure that any cars in the bridge are allowed to exit. This can be verified by checking that the SBE (Sensor Bridge Empty) is asserted. Then it should alternate the turns for the cars on each queue at the ends of the bridge. Always allowing the cars coming from either side to completely cross to the opposite side by verifying that there are no cars on the bridge.

Each queue has a sensor (Cars in East Queue, and Cars in West Queue) (CWQ_H, CEQ_H) that indicates if there is at least one car in either queue.

You can assume that each one of the four (4) lights can be controlled by two signals: one asserted high for Red, the other asserted high for Green, and if both signals asserted high then the Yellow light will be On.

The light control signals need to control two lights on the East side, and two on the West side. The control signal names will be as follows:

East Queue Light Red = EQLR_H,	WestQueue Light Red = WQLR_H,
East Queue Light Green = EQLG_H	West Queue Light Green = WQLG_H
East Bridge Light Red = EBLR_H	West Bridge Light Red = WBLR_H
East Bridge Light Green = EBLG_H	West Bridge Light Green = WBLG_H

Your FSM should alternate in an fair manner the use of the bridge for cars from both sides, but should be capable to allow continuous flow from one side only when there are no cars on the other side.

A complete solution to this problem will include the following:

-An FSM Block Diagram showing all inputs and all outputs

-A State Transition Diagram for a Moore FSM using the correct notation for states and branches, and including the Yellow light feature.

-A VHDL Model for the FSM using an architecture with two Process() statements.

One process to model the state flip flops. This process will be sensitive to the CLK signal and will load the value of the NextState signal vector, into the PresentState signal vector.

The second process will model the next-state combinational functions logic. To do this it will be sensitive to the present state vector, and to the input sensor signals.

The third process will model the outputs combinational functions logic. To do this it will be sensitive to the present state vector signals.

Your VHDL Model must compile without errors

-A VHDL Model for the Test Bench Simulation including Simulation Results screen capture