[1] Design a Finite State Machine (FSM) to control the traffic lights at an intersection of...

   

Transcribed Image Text:

[1] Design a Finite State Machine (FSM) to control the traffic lights at an intersection of a north-south road with an east-west road, as shown in the illustration below. Car det 1000 000 ●00 Car det OOO carew rst cik FSM 6 lights The FSM takes an input carew that indicates that a car is waiting on the east-west road. The FSM takes a second input, rst, that resets the FSM to a known state. There are six lights to control, green, yellow, and red, for both the north-south road and the east-west road. Consequently, the FSM outputs six control signals, one for each of the lights. An English-language description of the FSM is given below: (1) Reset to a state where the light is green in the NS direction and red in the EW direction. (2) When a car is detected in the EW direction (carew= 1), go through a sequence that makes the light go green in the EW direction and then return to green in the NS 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. [2] Consider the traffic light controller designed in problem 3. Implement the FSM as a synchronous sequential logic circuit. Choose the Binary Code state assignment (i.e. 00, 01, 10, 11). Show the state table/ state assigned table. Show K-maps for the next-state variables and output variables. Derive expressions for the next-state logic and the output logic. Draw the sequential logic circuit, including the combinational logic circuits for the next- state and output, and the state register. 3. [1] Modify the traffic-light controller FSM (from problem 1) so that it takes an additional input, carns, that indicates when there is a car waiting in the NS direction. Change the logic so that, once the light has changed to EW, it stays with EW green until a car waiting in the NS direction is detected. Draw the state diagram. [1] Design a Finite State Machine (FSM) to control the traffic lights at an intersection of a north-south road with an east-west road, as shown in the illustration below. Car det 1000 000 ●00 Car det OOO carew rst cik FSM 6 lights The FSM takes an input carew that indicates that a car is waiting on the east-west road. The FSM takes a second input, rst, that resets the FSM to a known state. There are six lights to control, green, yellow, and red, for both the north-south road and the east-west road. Consequently, the FSM outputs six control signals, one for each of the lights. An English-language description of the FSM is given below: (1) Reset to a state where the light is green in the NS direction and red in the EW direction. (2) When a car is detected in the EW direction (carew= 1), go through a sequence that makes the light go green in the EW direction and then return to green in the NS 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. [2] Consider the traffic light controller designed in problem 3. Implement the FSM as a synchronous sequential logic circuit. Choose the Binary Code state assignment (i.e. 00, 01, 10, 11). Show the state table/ state assigned table. Show K-maps for the next-state variables and output variables. Derive expressions for the next-state logic and the output logic. Draw the sequential logic circuit, including the combinational logic circuits for the next- state and output, and the state register. 3. [1] Modify the traffic-light controller FSM (from problem 1) so that it takes an additional input, carns, that indicates when there is a car waiting in the NS direction. Change the logic so that, once the light has changed to EW, it stays with EW green until a car waiting in the NS direction is detected. Draw the state diagram.

Answer rating: 100% (QA)

COMBINATION... View the full answer