搜索资源列表
zhou_end2
- 我的数据结构课程设计，卡诺图化简。在算法上摸索了很久，第一次去交的时候因为老师的几个刁钻的数据给刷下来，至今仍心有余悸。还有一个用PASCAL写的16变量化简的，可不知道放哪去了。-my data structure curriculum design, Karnaugh map of SR. The algorithm groping for a long time, the first to go out and make the
karo
- 这是我的课程设计卡诺图的图形化简，是有TC做的-This is my course design Karnaugh map graphical presentation is done TC
Q-MLogicOptimization
- 卡诺图在变量数目很多时，不 容易 化简，Quine-McCluskey(Q-M）方法基本原理 与卡诺图相同当变量数目很多时，或者有许多function要做化简时，都需要使用计算机来做，而Q-M方法为一个系统的逻辑代数化简流程.-Karnaugh map of the large number of variables.
kanuotu
- 卡诺图化简的算法，保证正确，自己的课程设计，算法精妙-Karnaugh map of simple algorithms, ensuring correct, their curriculum design, algorithm carefully
reduce
- 一个有趣的卡诺图划简程序。学生可自己填充卡诺图，并自己化简。程序可自动评定是否正确，并可列出所有的化简方法。-an interesting Kano plan is simple procedures. Students can fill their Karnaugh map, and their simplification. Procedures can automatically assess whether correct an
zhou_end2
- 我的数据结构课程设计，卡诺图化简。在算法上摸索了很久，第一次去交的时候因为老师的几个刁钻的数据给刷下来，至今仍心有余悸。还有一个用PASCAL写的16变量化简的，可不知道放哪去了。-my data structure curriculum design, Karnaugh map of SR. The algorithm groping for a long time, the first to go out and make the
karo
- 这是我的课程设计卡诺图的图形化简，是有TC做的-This is my course design Karnaugh map graphical presentation is done TC
Q-MLogicOptimization
- 卡诺图在变量数目很多时，不 容易 化简，Quine-McCluskey(Q-M）方法基本原理 与卡诺图相同当变量数目很多时，或者有许多function要做化简时，都需要使用计算机来做，而Q-M方法为一个系统的逻辑代数化简流程.-Karnaugh map of the large number of variables.
kanuotu
- 卡诺图化简的算法，保证正确，自己的课程设计，算法精妙-Karnaugh map of simple algorithms, ensuring correct, their curriculum design, algorithm carefully
reduce
- 一个有趣的卡诺图划简程序。学生可自己填充卡诺图，并自己化简。程序可自动评定是否正确，并可列出所有的化简方法。-an interesting Kano plan is simple procedures. Students can fill their Karnaugh map, and their simplification. Procedures can automatically assess whether correct an
Kanoi
- 编译环境：tuboc2.0 编译方法：在桌面建一TC.exe的快捷方式，将程序拖入快捷方式编译执行即可 程序在Dos环境通过图形界面函数和鼠标驱动接口函数，实现能够用鼠标点击的卡诺图动态化简-Compiler environment: tuboc2.0 compiler Methods: One TC.exe built on the desktop shortcut, drag the shortcut to the prog
Ckanuotu
- 该程序可以化简卡诺图。首先输入真值，然后该程序会将化简以后的最简形式输出-Simplification of the procedure can be Karnaugh map. First of all input true value, then the program will simplify the simplest form of the future output
Karnaughmaplogicfunction
- 学习电气要懂数字电路，数字电路得学习逻辑函数的卡诺图化简法,^_^，这篇文章易懂，是学习的好资料。-Learning to understand the number of electrical circuits, digital circuits have to learn from the Karnaugh map logic functions Simplification Act ,^_^, this article easy
practice
- 示波器扩展——卡诺图显示。设计并制作一个能显示组合电路卡诺图的示波器扩展电路。基本要求——输入四变量组合逻辑输出-Oscilloscopes expansion- Karnaugh map display. Design and production of a Karnaugh map showing the combination of the circuit of the oscilloscope expansion of the
Karnaugh_Maps
- In the logic circuit design, we have to optimize the logic. On the one of method, it is used karnaugh map.-In the logic circuit design, we have to optimize the logic. On the one of method, it is used karnaugh map.
karnaugh_inputs
- KARNAUGH_INPUTS Boolean inputs for a Karnaugh map. K = KARNAUGH_INPUTS(N) produces a table (array) of boolean inputs for a Karnaugh map.Each boolean input has N bits, and there are 2^N entries in the table.
51359902-Logic-Design-part-2
- Separated Simplification Method • One has to derive the symmetrical logical equation while using the Karnaugh maps of the logic function • This method, i.e. to perform twice the Boolean simplification for
1038_source
- karnaugh diagram implemented
Karnaugh-map
- it is a new theory of k-map, which describes all function of kmap and all fundamental things of kmap which is used in digital electronics
karnaugh-map-solver
- karnaugh map solver solve the map with 10 variables