基于K图的逻辑函数OC展开式在固定极性下的化简

分析了K图在表示逻辑函数最大项展开式的特点和性质,发现在K图中作含某格的所有聚合圈相应的和项中所含变量的极性与该格对应的最大项具有相同的极性.在此基础上提出了基于K图的逻辑函数OC展开式在固定极性下化简的新方法.该方法可以利用K图直接得到逻辑函数的最小化的OC展开式,从而省略了传统方法把K图转换为dj图的步骤,具有直观、方便等特点.

Simplification of OC expansions for logic function under fixed polarity based on K-map

The feature and property of K-map were analyzed from the viewpoint of the expression of the maxterm expansion for a logic function.It was found that each variable in the sum term corresponding to any circle through certain square has the same polarity as the variable in the maxterm corresponding to this square.Based on it,a graphic method simplifying the OR-Coincidence(OC) expansions of a logic function under fixed polarity by using K-map is presented.By the use of this method the minimized OC expansion of a logic function with fixed polarity can be obtained from K-map,and thus leading to omit the step to convert K-map to d_j map.It has several features such as intuide and convenience.