基于K图的函数RM展开式在固定极性下的最小化  

Function minimization with fixed polarity based on K map

作　　者：刘观生[1] 陈偕雄[1] 

机构地区：[1]浙江大学信息与电子工程系,浙江杭州310028

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

基　　金：浙江省科技厅资助项目(001110021).

摘　　要：分析了K图的性质,发现在K图中过某格的所有聚合圈相应的各乘积项所含变量与该格对应的最小项均有相同的极性,在此基础上提出了得到基于K图函数RM展开式在固定极性下的最小化的图形方法.该方法可以从K图直接得到函数的最小化的RM展开式,从而省略了传统的把K图转变为bj图再求最小化的步骤.它具有直观、简单、易于掌握等特点.此外,文中还提出了该方法的改进算法.The character of K map is analyzed, and it is found that all the circles through certain grid has the same polarity with corresponding minimal product term of the grid in K map. Based upon this, the paper presents a graphic method of function RM expansion minimization with fixed polarity based on K map. The RM expansion minimization expression can be gained directly from K map by using this method, The translation between K map and bj map can be omitted, and the method has many advantages, such as convenience, easy mastery, simplicity, and so on. Furthermore the paper discusses the improved method.

关 键 词：逻辑电路 逻辑函数 K图 RM展开式 固定极性 最小化 BJ图 聚合圈 

分 类 号：TN791.02[电子电信—电路与系统]