论文标题
通过制作非功率的两个元素来简化karnaugh地图
Simplifying Karnaugh Maps by Making Groups of a Non-Power-of-Two Number of Elements
论文作者
论文摘要
当我们研究开关理论课程中的Karnaugh地图时，我们了解到，地图中的图片必须组合成$ a \ times b $元素的组，为$ a $ a $ a $ b $ powers。结果是逻辑函数描述为产品之和。本文表明，我们还可以在$ a $ a $ a和/或$ b $等于三个的地方组成。这不会导致产品总和，而是逻辑函数比逻辑门更简单的逻辑函数。这个想法稍后将其扩展到$ 2^n-1 $元素的组。
When we study the Karnaugh map in the switching theory course, we learn that the ones in the map must be combined in groups of $a \times b$ elements, being $a$ and $b$ powers of two. The result is the logic function described as a sum of products. This paper shows that we can also make groups where $a$ and/or $b$ are equal to three. This does not result in a sum of products, but in a logic function that is simpler than the sum of products in terms of logic gates. This idea is extended later in the paper to groups of $2^n-1$ elements.
