2. [M2] Traffic Control Group 2 Chun Han Chen Timothy Kwan Tom Bolds Shang Yi Lin Manager Randal Hong Wed. Sep 17 Overall Project Objective : Dynamic Control The Traffic Lights

3. Status  Design Proposal  Chip Architecture  Behavioral Verilog Implementation (in processing)  Size estimates/  floorplanning  Behavioral Verilog simulated  Gate Level Design  Component Layout/Simulation  Chip Layout  Complete Simulation

4. Traffic Flows Sensors (Blue) To detect the car entered Sensors (Red) To detect the car leaved

5. Traffic Light Flow Whenever pedestrian push the button, then this light will insert in the end of this cycle. Arm 1 Arm 2 Red GreenY Green (S traight + R ight )YRed+Green(L eft ) Red Y Green (S traight + R ight )YRed+Green(L eft )Y Phase 1Phase 2 Cycle We defined our cycle is equal to Phase 1 + Phase 2.

6. Hold until n 1 or n 2 changes Light favors n 1 or n 2 ? n1n1 n2n2 T<r 1 ? T<r 2 ? T>= R 1 ?T>= R 2 ? n 1 =0? n 2 =0? f 1 <=0? f 2 <=0? Switch Light Reset T = 0 No Yes No Yes No Light favors arm 1 or arm 2 ? n1n1 n2n2 T<r left ? T>= R left ? No Yes No Yes No n 1 not change in T = 5? No Control reset Pedestrian For Green light For Red + Left T>= R p ? Yes No For Pedestrian n 2 not change in T = 5? n 1, n 2 :# of cars T :Time spent in this phase R i, r i : Max. and Min. time for each phase f i : the control function f 1 = α 1 *n 1 + β 1 – n 2 f 2 = α 2 *n 2 + β 2 – n 1

7. Pedestrian Algorithm  Requires input from user if person is crossing  Once input is discovered, the algorithm lets the system finish the phase of one arm, then allows the pedestrian to cross by turning all the lights red  If there is no input from a person, the algorithm causes a pedestrian walk phase after four arm phases

8. Left Turn Algorithm  Added a new tree to the data flow.  First the right and straight turns on both sides of the arm are free to move. Then the left turns on both sides are free to move.  In one arm phase, there exists two smaller phases in it.  1. Calculates F like the normal algorithm  2. Assuming minimum phase time for left hasn ’ t been hit. If a car hasn ’ t passed over the sensor in a time period of 5 seconds, switch to the next Arm. Otherwise continue to wait till there are no cars in the time period or maximum phase time has been hit.

9. Adder Subtractor Register (Total Number) Adder N2 F Accumulator Alpha & Beta Accumulator Arm 1 Arm 2 Compute N2, α2 and β2 Ni = Number of cars queued F1(t) = α1N1(t) + β1 – N2(t) F2(t) = α2N2(t) + β2 – N1(t) T = time elapsed since last change of phase r, R = minimum, maximum allowable durations of phase for arm_i FUNCTION BLOCK Initialize & User Inputs ComparatorFSMSwitch Counter Time Clock Pedestrian Register Provide comparator some values, such as r, R, T, α,β, N1 and N2. Compute N1 Compute β Inputs and Initialized T Reset T=0 Decide when to switch

10. Adder Subtractor Register (Total Number) Adder N2 F Accumulator Alpha & Beta Accumulator Arm 1 Arm 2 Compute N2, α2 and β2 Ni = Number of cars queued F1(t) = α1N1(t) + β1 – N2(t) F2(t) = α2N2(t) + β2 – N1(t) T = time elapsed since last change of phase r, R = minimum, maximum allowable durations of phase for arm_i FUNCTION BLOCK Initialize & User Inputs ComparatorFSMSwitch Counter Time Clock Pedestrian Register Compute N1 Compute β Inputs and Initialized T Reset T=0 Decide when to switch 12 Provide comparator some values, such as r, R, T, α,β, N1 and N2.

11. Transistor Count Estimates DevicesNumber of Transistors Divider + Sub15,000 Adder15,000 Multiplexer10,000 MUX804 FSM2000 Total42804 Density265000 micro^2