Question: Consider 4 ways traffic lights, where each traffic light must be Yellow ( Amber ) for 1 tick and Green for 3 ticks. ( Download

Consider 4 ways traffic lights, where each traffic light must be Yellow (Amber) for 1 tick and Green for 3 ticks. (Download the initial file from Canvas "Trafficebiaht_sirc".)
ic Light Sequenc
Part 01- State Diagram:
1. Based on the above introduction, draw the state diagram for the traffic light circuit. North-South will have a similar sequence as well as East-West. Two-way traffic flow.
2. Hint:
a. Determine the number of states based on the required sequence of Red \(\gg \) Yellow \(\gg \) Green. Assign binary values for each state (\(2^{n}\)).
b. Green light will stay for 3 ticks and Yellow for 1 tick and back to Red.
c. Use one control input.
d. Use smart art or any appropriate drawing tool to create your state diagram and place it inside the box. Make sure to properly label them
Part 02- State Table:
1. Draw and complete the state table for the above sequential circuit using your preferred flip-flop. Consider all the states input/s, and output/s (if applicable).
Part 03- Simplified State Equations Using K-Map:
1. Derive the simplified state equations using K-Map for your flip-flop circuits. Show the Solution (use pen and paper then put the image below or any drawing tool).
Part 04- Traffic Light Full Control Circuit:
1. Design the complete logic circuits using the state table and simplified Boolean Functions. Use Synchronous Sequential Circuit only.
2. Simulate your design and export the Timing Diagram of your Circuit as PNG after completing all the states and insert it below (Simulate Menu > Timing Diagram).
Timing Diagram
Consider 4 ways traffic lights, where each

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Electrical Engineering Questions!