[PSD12] Exercise 3.24 #184
Replies: 5 comments
-
|
ragazzi aiuto |
Beta Was this translation helpful? Give feedback.
-
Esercizio OriginaleTesto : Engineering students are moseying between their dorms and the labs on Academic Ave. They are busy reading about FSMs in their favorite textbook and aren’t looking where they are going. Football players are hustling between the athletic fields and the dining hall on Bravado Boulevard. They are tossing the ball back and forth and aren’t looking where they are going eitherr. Several serious injuries have already occurred at the intersection of these two roads, and the Dean of Students asks Ben Bitdiddle to install a traffic light before there are fatalities.
SoluzioneBen decides to solve the problem with an FSM : he installs two traffic sensors, TA and TB, on Academic Ave. and Bravado Blvd., respectively. Each sensor indicates TRUE if students are present and FALSE if the street is empty. He also installs two traffic lights, LA and LB, to control traffic. Each light receives digital inputs specifying whether it should be green, yellow, or red. Ben provides a clock with a 5-second period. On each clock tick (rising edge), the lights may change based on the traffic sensors. He also provides a reset button so that Physical Plant technicians can put the controller in a known initial state when they turn it on.
Queste informazioni dovrebbero essere sufficienti a risolvere il nuovo esercizio, per la soluzione completa della versione originale fare riferimento alle pagine 123-128 del libro di testo. |
Beta Was this translation helpful? Give feedback.
-
InterpretazioneIl problema in cui incorriamo è che non appena il semaforo di una strada diventa verde le auto iniziato a passare l'incrocio, ma ci sono ancora persone a cui non bastano i 5 s di giallo per finire di attraversare. Quindi vorremmo che entrambe le luci rimangano rosse per altri 5 s prima che una delle due diventi di nuovo verde. SoluzionePer fare questo, siccome l'FSM che vogliamo modificare è di Moore, aggiungo 2 nuovi stati, Osservazione: "Perchè aggiungere 2 stati e non 1 se fanno la stessa cosa?", il problema non è l'output, ma decidere lo stato successivo, per farlo dobbiamo basarci sugli input ricevuti dagli stati
State Encodings:
Tramite delle K-map a 5 variabili potremmo ricavarci le funzioni minime, ma non è richiesto, quindi lascio l'esercizio al lettore.
|
Beta Was this translation helpful? Give feedback.
-
|
@Elia-Belli a grandi linee come avresti ricavato le funzioni minime usando k-maps a 5 variabili?
perdonate il disordine ma questo dovrebbe essere il circuito risultante (molto simile a quello di elia)
|
Beta Was this translation helpful? Give feedback.
-
|
@FedVlogger17 ti faccio l'esempio per la funzione di
|
Beta Was this translation helpful? Give feedback.
-
Exercise 3.24 Accidents are still occurring at the intersection of Academic Avenue
and Bravado Boulevard. The football team is rushing into the intersection the
moment light B turns green. They are colliding with sleep-deprived CS majors
who stagger into the intersection just before light A turns red. Extend the light controller described during the last lesson so that both lights are red for 5 seconds before either light turns green again. Sketch your improved Moore machine state transition diagram, state encodings, state transition table, output table, next state and output equations, and your FSM schematic.
Beta Was this translation helpful? Give feedback.
All reactions