Finite State Machine Continued - FSU Computer Science有限状态机继续佛罗里达州立大学计算机科学.pptVIP

下载本文档

4
0
约9.47千字
约 40页
2018-04-01 发布于江西
举报
版权申诉

Finite State Machine Continued - FSU Computer Science有限状态机继续佛罗里达州立大学计算机科学.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Finite State Machine Continued - FSU Computer Science有限状态机继续佛罗里达州立大学计算机科学

State To tell if a controller has states or not, the simplest way is to check if the controller’s output is relevant to what happened in the past. If it is relevant, it has state; otherwise it does not. The vending machine controller has state, because the controller’s response to the same input (e.g., SA) is different depending on the number of quarters inserted. Identifying the States We need at least three states to remember how many quarters we have got. S0: The initial state. Got 0 quarters. S1: Got 1 quarters. S2: Got 2 quarters. State Diagram S0 S1 S2 CIS = 1 State Diagram When got $0.50, if the user presses select button, should release drink, take money, and go back to state S0. But is this diagram correct? S0 S1 S2 CIS = 1 SA = 1 State Diagram Not complete – we haven’t take action yet. When the SA is pressed, the controller should change some output signal – not shown in the diagram S0 S1 S2 CIS = 1 SA = 1 Change the output The output to be changed, clearly, is the L_A and L_TK. By the specification, we should let them be 1 for one clock cycle. clk L_A SA L_TK Other options Can we just let the latch be controlled by the SA button, meaning that the latch is open when SA is pressed? If we do this, I will just get free drinks. So the latch has to be determined by the states somehow. Can we just say that the latch is open if in state S2 and when SA is pressed? When in state S2, if SA is pressed, the next state is not S2 – the overlapping time may not be enough because SA can become 1 at arbitrary time. The Action State For SA To ensure that the control signal stays high for one clock cycle, we need another state. In S3, L_A = 1 L_TK = 1 S0 S1 S2 CIS = 1 SA = 1 S3 automatic The complete diagram S0 S1 S2 CIS = 1 SA = 1 S3 automatic RF = 1 SB = 1 S4 S5 S3: L_A=1, L_TK=1 S4: L_B=1, L_TK=1 S5: L_RF=1 * CDA3100 week12-3.ppt * * CDA3100 week12-5.ppt * * CDA3100 week12-5.ppt * Finite State Machine Continued In class excercise How to implement a “counter”, which