Simplifying Karnaugh Maps by Making Groups of Non-power-of-two Elements

Abstract

AbstractWhen we study the Karnaugh map in the switching theory course, we learn that the ones in the map are combined in rectangles whose length and width must be a power of two. The result is the logic function described as a sum of products. This paper shows that we can also make groups where the length and width of the rectangles are equal to three. This results in a logic function that is simpler than the sum of products in terms of logic gates, leading to more hardware-efficient circuits. This idea is extended later in the paper to other groups of elements. Finally, a new perspective on the Karnaugh map that integrates the proposed approach with the conventional one is provided. This can be used in switching theory courses to improve the explanation of the Karnaugh map.