| Summary: | Karnaugh map is one of the methods that are widely used to simplify boolean expressions by using neighborhoods. The most important advantage provided by K-Map is to realize an electronic circuit with a minimum number of physical gates. K-Map is one of the most important subjects of electronic and logic courses, but students sometimes can not identify groups when simplifying using K-Map. In this study, inputs were added to easily identify large groups with KMap. With the addition of elements, large groups can be detected easily. Once large groups have been identified, the added elements have been removed to obtain the true expression. Only logical addition (OR) and logical multiplication (AND) operations are used for simplification on the K-Map. This paper demonstrates that the subtraction process of K-Maps can be done and proved by using De-Morgan theorem. In this study, subtraction is performed on K-Map for the first time in
the literature up to now and an effective subtraction-based simplification method is proposed for K-Maps. De Morgan theorem and experimental results show the correctness of the proposed
method.
|
|---|
