-4同步状态机设计1chenyu祥解.pptVIP

下载本文档

173
0
约1.12万字
约 42页
2016-04-19 发布于湖北
举报
版权申诉

-4同步状态机设计1chenyu祥解.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文档。上传文档

Analyze the clocked synchronous state machine in the Figure below. Write excitation equations, excitation/transition table, and state table (use state names A–D for Q1 Q0 = 00–11). ，说明电路是否具有自启动特性。 KEY FOR EXERCISE 1 1、excitaition equations 4、transition table 4、transition /output table 4、state/output table State diagram A state diagram presents the information from the state/output table in a graphical format. It has one circle (or node) for each state, and an arrow (or directed arc) for each transition. Some definitions(P552-553) a transition expression(转移表达式) Each arc is labeled with a transition expression; a transition is taken for input combinations for which the transition expression is 1. Transitions labeled “1” are always taken. Mutually exclusive (互斥的) No two transition expressions(转移表达式) can equal 1 for the same input combination,since a machine can’t have two next states for one input combination. all inclusive (完备的) For every possible input combination, some transition expression must equal 1, so that all next states are defined. Example 3 (P552-Figure 7-44) Definitions (P574) 1. Mutual exclusion. For each state, show that the logical product of each possible pair of transition expressions on arcs leaving that state is 0. If there are n arcs, then there are [n(n - 1)] / 2 logical products to evaluate. 2. All inclusion. For each state, show that the logical sum of the transition expressions on all arcs leaving that state is 1. Example 3 (P552-Figure 7-44) attention 1、analysis steps； 2、difference between MEALY machine and MOORE machine； 3、if a machine with n inputs,we would have 2n arrows leaving each state. 4、 Mutual exclusion\ All inclusion. 7.4 Clocked Synchronous State-Machine Design时钟同步状态机设计 7.4 Clocked Synchronous State-Machine Design Construct a state/output table (状态输出表) corresponding to the word description. (Optional)Minimize the number of states. State assignment.（choose a set of state variables） Substitut