您要查找的是不是:
- next state Karnaugh map 次态卡诺图
- The three-variable Karnaugh map has eight squares. 三变量卡诺图有八个方格。
- Students can fill their Karnaugh map, and their simplification. 一个有趣的卡诺图划简程序。学生可自己填充卡诺图,并自己化简。
- That returns the next state given an XML node. 它会返回给定XML节点的下一个状态。
- This method calculates the next status functions of each trigger in a sequenced circuit and shows all the functions within one Karnaugh map, and then converts into status chart. 该方法首先求出时序电路中各触发器的次态表达式,然后把各次态表达式表示在同一张卡诺图上,最后再把它转换成状态图。
- I think I'll fly over and see my relatives in the next state. 我想我得飞到邻国去看我的亲戚。
- A new method for expressing the high-degree block of Karnaugh map with two-codes is presented. 本文还介绍了卡诺图高维块的双码表示的新方法。
- Besides, the Karnaugh map method and algebra method are presented for designing component level circuits. 此外,本文提出元件级电路设计的卡诺图方法和代数方法。
- To the next state, which displays the data in application interface. 传递给下一状态,这将在应用程序界面上显示数据。
- Karnaugh map plays an important role in the simplification of logic function and the design of logic circuit. 摘要卡诺图在逻辑函数的化简和逻辑电路的设计中,有着重要作用。
- This paper has presented a method of designing the simplest logic circuits with NOR gates with Karnaugh map. 给出了采用或非门、利用卡诺图设计最简逻辑电路的方法,并用实例论证这个方法是最简捷的方法,同时也具有一般性。
- Therefore, the Karnaugh Map got the extensive application in electronics technique. 因此,卡诺图在电子技术中得到了广泛的运用。
- First, the Karnaugh map of variables is drawn according to the number of the variables. 然后将表达式中乘积项逐个地填入卡诺图的小方格中。
- The prerequisite of the correct use of karnaugh map is to full in the map with the given logic function correctly. 正确运用卡诺图的前提是把给定的逻辑函数正确填图,可以利用卡诺图将逻辑函数化简为各种最简表达式;
- When this task is completed, the workflow updates the status of the item and progresses to the next state. 完成该任务后,该工作流会更新该项目的状态并进入下一状态。
- Then, the product terms of the expression are filled in the panes of the Karnaugh map respectively. 最后所有乘积项都填格完毕后,若看到卡诺图中有的方格还是空的,则在这些空格填0;
- According to the characteristics of elementary cellular automaton, the function forms of elementary cellular automaton evolution rules are deduced by using the Karnaugh map. 摘要依据初等元胞自动机演化规则的特点,借助卡诺图化简,导出初等元胞自动机演化规则的函数形式。
- The state assignment is single transition time (STT), and with this method, a relatively simple set of next state equations can be obtained. 它的状态分配是一次转换的(即STT),并能得到简单的次状态方程组。
- According to different methods of simplifying logic function,this thesis discussed the method of simplifying Karnaugh map by using computer. 讨论了逻辑函数卡诺图化简的计算机实现, 提出了基于最大覆盖的问题求解方法。
- The Reinstall property indicates that this software element can transition to its next state even if a software element of the same version already exists in the environment. Reinstall属性表示这个软件元素可以过渡到下一个状态,即使同一版本的软件元素已经在环境中。