第七章 时序逻辑设计原理 2.ppt

Exp3: a combination lock requirement: UNLK=1 if and only if X is 0 and the sequence of inputs received on X at the preceding seven clock ticks of X was 0110111. HINT=1 if and only if the current value of X is the correct one to move the machine closer to being in the “unlocked” state (with UNLK=1). It is a sequence-detector machine 7.5 designing state machines using state diagram Difference between state table and state diagram design： 状态表是穷举列表的方法 状态图表达状态的转移用一条带转移表达式的弧线，其中可能包含多个输入。经常不能一次达到状态转移的完备性。 Exp1: a sequence-detector, if the serial input bits are continuous “1101”, then output 1. S0 S1 S11 S110 Receive first 1 Receive continuous 11 Receive continuous 110 10 S1101 00 10 00 10 00 10 00 11 00 Receive a single 0 Receive continuous 1101 S X C 状态图中的等价状态的判断： 观察是否有两个状态的离开弧线有相同的转移表达式并值相同一个状态，如果是，则两个状态是等价状态。 本例中S0和S1101是等价状态。 状态赋值并建立转移/输出表及激励表： Q1Q2 X 0 1 00 00，0 01，0 01 00，0 11，0 11 10，0 11，0 10 00，0 00，1 Q1*Q2*，C Q1Q2 X 0 1 00 00，0 01，0 01 00，0 11，0 11 10，0 11，0 10 00，0 00，1 D1D2，C S0 S1 S11 S110 Excitation equation： D1=Q1·Q0+Q0·X D2=Q1’·X+Q0·X Output equation： Z=Q1·Q0’·X 例2、雷鸟车尾灯的状态机 input：L（LEFT）、R（RIGHT）、H（HAZ） output：LA、LB、LC、RA、RB、RC Working condition： input L — LA、LB、LC lighting on successively and off input R — RA、RB、RC lighting on successively and off； input H — all lights flashing on and off no input, all lights off. L1 LA on L2 LA、LB on L3 LA、LB、LC on R1 RA on R2 RA、RB on R3 RA、RB、RC on LR3 all on simultaneous IDLE all off LA LB LC RA RB RC First State diagram IDLE LR3 L1 L3 L2 R1 R3 R2 H=1 L=1 1 1 1 R=1 1 1 1 Some faulty aspect …… Thinking carefully 1 H’L’R’ input S H L R S* IDLE 1 × × LR3 IDLE × 1 1 LR3 IDLE 0 1 0 L1 IDLE 0 0 1 R1 IDLE 0 0 0 IDLE IDLE LR3 L1 L3 L2 R1 R3 R2 H+LR H’LR’ 1 1 1 H’L’R 1 1 1 1 H’L’R’ Corrected diagram IDLE LR3 L1 L3 L2 R1 R3 R2 H+LR H’LR’ H’ H’ 1 H’L’R 1 H’ H’ 1 H’L’R’ H H H H Corrected diagram again State assignment 8 states，need 3 f--fs，so named Q0、Q1、Q2。 Assign state：