一种新的卡诺图化简法

设计了一种新的卡诺图化简方法，可以对七变量及以上的逻辑函数进行化简．这种新卡诺图化简法化简逻辑函数不是采用画包围圈的办法，而是先用新卡诺图来判断哪些标“1”的单元是逻辑相邻的单元，然后再把任何2^m(m=0，1，2，…，n)个标“l”的逻辑相邻单元所对应的最小项项号所对应的二进制数集中到一起，把变量取值保持不变的变量保持下来，把变量取值发生变化的变量去掉，剩下的变量之“与”就是这2^m个逻辑相邻单元化简后的乘积项，这种方法对化简任意变量的逻辑函数都适用。

A New Type of Karnaugh-map Simplification Approach

The method of Karnaugh-map is a systematical sinplification approach for logic function. The conventional method of Karnaugh-map can only simplify the ligic-functions with 6 variables and the below, but becomes usefulless when it meets the higher ones. The new type of Karnaugh-map and its simplification method can solve the problem. The map is easy to draw, and the corresponding minterm number of each unit can be marked up easily too. It no longer uses the way drawing losed circles. Firstly, judge out the units that are logically relevant among the ones marked 1 by the new Karnaugh-map. Secondly, put together the binary of the minterm numbers of any 2m (m=0,1,2,...,n) logic relevance units marked 1, reserve the variables with fixed values, and delete the unfixed ones. Now, the "And" of the left variables is the very product-term of the 2m logic relevance units after being simplified . This method absolutely applies to the simplification for logic function of any variables .