A modified Karnaugh map technique

@article{Holder2005AMK,
  title={A modified Karnaugh map technique},
  author={Michel Elizabeth Holder},
  journal={IEEE Transactions on Education},
  year={2005},
  volume={48},
  pages={206-207}
}
  • M. E. Holder
  • Published 1 February 2005
  • History
  • IEEE Transactions on Education
A new self-documenting method of constructing Karnaugh maps that assigns a unique identifier to each element in a Boolean minterm expression and uses these identifiers to construct the map is discussed. This method provides an immediate "audit trial" for the map's creation and facilitates the teaching of Karnaugh maps by including enough information within the map to show the exact method used to construct the map. During the grading process, this information enables the teacher to better… 
View on IEEE
dsa-research.org
27 Citations
Highly Influential Citations
1
Background Citations
6
Methods Citations
15

Figures from this paper

27 Citations

Generalized Karnaugh Map Method for Boolean Functions of Many Variables

A tree of Karnaugh maps called generalized Karnaugh map is proposed, which can be constructed for any number of variables and analysed systematically to generate all prime implicants by going through only one map of 16 squares at a time.

A Novel Graphical Technique for Combinational Logic Representation and Optimization

We present a new technique for defining, analysing, and simplifying digital functions, through hand-calculations, easily demonstrable therefore in the classrooms. It can be extended to represent…

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

  • M. Garrido
  • Mathematics
    Circuits, Systems, and Signal Processing
  • 2022
When 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…

An Extensive Karnaugh Mapping Tool for Boolean Expression Simplification

An extensive Karnaugh mapping tool is developed which overcomes the existing research's limitation in this related area and outperforms existing approaches in terms of computation time and the percentage of relative error is much lower which is fulfilled the satisfactory level.

A Karnaugh map based approach towards systemic reviews and meta-analysis

The study concluded that this pictorial graphing as expected had helped in simplifying the overview of meta-analysis and systemic reviews and henceforth having undesirable potential of consecutive misunderstandings in social and operational methodologies.

Simplifying Karnaugh Maps by Making Groups of a Non-Power-of-Two Number of Elements.

This paper shows that one can also make groups where $a$ and/or $b$ are equal to three, which results in a logic function that is simpler than the sum of products in terms of logic gates.

Mathematical Study for Reduction of Variables in Karnaugh Map

The paper aims to find a new formula which can be used to find the number of variables reduced in a Karnaugh map and theNumber of variables to be expressed and graphical natures of the reduced as well as expressed terms are plotted.

C – Minimizer Algorithm: A New Technique for Data Minimization

An approach, Consummate minimizer (Cminimizer) has been proposed which overcomes the limitations of such conventional methods and produces a minimized expression containing minimizing elements.

New teaching method to simplify Boolean logic functions using 3D cubes

In this work, a new teaching method to derive the Boolean logic functions is presented. Physical 3D cubes will be used to construct a 3D structure that will assist students in representing minterms…

B-Learning in the Teaching-Learning of Boolean Function Simplification

Students in the experimental group, who used the “Boolean Soft” software tool to reinforce the learning of the Simplification of Boolean Functions, made better progress when compared to the students in the control group who did not use it.

References

Fundamentals of logic design

This book covers in depth such essential concepts as the use of Boolean algebra to describe the signals and interconnections in a logic network, use of systematic techniques for simplification of a logicnetwork, interconnection of simple components to perform a more complex logic function.