函数CRM展开式在固定极性下最小化的图形方法  

Function minimization with fixed polarity based on d_j-map and K-map.

作　　者：肖林荣[1] 赵美玲[2] 陈偕雄[1] 

机构地区：[1]浙江大学信息与电子工程系 [2]绍兴文理学院机电工程系,浙江绍兴312000

出　　处：《浙江大学学报（理学版）》2006年第1期58-61,共4页Journal of Zhejiang University（Science Edition）

摘　　要：分析了dj图、K图的性质,在此基础上提出了基于dj图、K图的函数CRM展开式在固定极性下最小化的图形方法.它具有直观、简单、易于掌握等特点.The concerned characteristics of dj-map and K-map were analyzed and it was found that all the circles through certain grid has the same polarity with corresponding maximal summation term of the grid in K-map. Based upon these, a graphic method of function CRM expansion minimization with fixed polarity based on dj-map and K- map was presented in this paper and several examples were also given. The CRM expansion minimization expression can be obtained directly from dj map and K map by using this method. It was shown that the method has many advantages, such as convenience, easy mastery, simplicity, and so on.

关 键 词：CRM展开式 固定极性 DJ图 K图 图形法 

分 类 号：TP331[自动化与计算机技术—计算机系统结构]