Digital Logical Circuit（俞鹤伟）chapter7-c.pptVIP

A common IDLE state is defined in which all of the lights are off . Initial state diagram and output table When a left turn is requested, the machine goes through three states in which 1, 2, and 3 of the left-hand lights are on, and then back to IDLE; right turns work similarly. In the hazard mode, the machine cycles back and forth between the IDLE state and a state in which all six lights are on . A corrected state diagram Solution: Give the HAZ input priority, and treat LEFT and RIGHT asserted simultaneously as a hazard request. A big problem in the initial state diagram : It doesn’t properly handle multiple inputs asserted simultaneously. A corrected state diagram For each state, no two expressions are 1 for the same input combination Some expression is 1 for every input combination Enhanced state diagram It would be safer to have the machine go into hazard mode as soon as possible when HAZ is asserted. State assignment There are many state assignments possible, we’ll use the one in Table 7-13. Eight states need a minimum of three flip-flops to code them. Transition list Each row contains the current state, next state, and transition expression for one arc in the state diagram. Each row corresponds to a transition or arc in the state diagram. 7.6 State-Machine Synthesis  Using Transition Lists 7.6.1 Transition Equations Transition equations define each next-state variable V* in terms of the current state and input. Transition p-term is the product of the current state’s minterm and the transition expression in the same row. For each row of the transition list that contains a 1 in the V* column, there is a transition p-term. The transition equation for Q2* The transition equation for Q1* Q0* 7.6.2 Excitation Equations Choice D flip-flops as the memory elements. Characteristic equation of D flip-flop: Q*=D Excitation equations of the state machine for controlling the tail lights of Thunderbird: D0=Q2’Q1’Q0’(H