| 术语 | Karnaugh map |
| 释义 | Karnaugh map 卡诺图 1. A rectangular diagram of a logic function of variables drawn with overlapping sub-rectangles such that each intersection of overlapping rectangles represents a unique combination of the logic variables and such that an intersection is shown for all combinations. 一种多变量逻辑函数(求值用)的方格图,横行表示一组变量(与取值),纵向表示另一组 变量(与取值),重迭(相交)的方格表示若干逻辑变量的一种唯一的组合(与取值),而且表示 了所有可能的逻辑变量的组合(与取值)。 2. A form of truth table used to describe the logic of relatively complex circuits (logic arrays， data selectors, multiplexors). The example is a map for the circuit of the data selector entry. It shows, for example, that if the select A signal is high(1) and B is low(0), the D1 data input passes through as the output. Each intersection of the map is a “minterm” and these are often identified by their binary numbers, for example, "11" identifies the D4 minterm. 一种真值表的形式,用于描述相对较为复杂的电路逻辑,如逻辑门阵列、数据选择器、 多路选择器。例中给出一张数据选择器输入电路的映象图,它表明(举例说), BA010D3D11D2D4 如选择A信号是高电平(即1),B是低电平(即0),则数据输入量D1作 为输出结果送出来。图中的每个小方格称为一个“小元”,通常用对应的二进制数来表示 (即标识)它们,例如,“11”标识的是D4这个小元。 |
| 随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条，基本涵盖了全部常用计算机术语的翻译及用法，是计算机学习及翻译工作的有利工具。