Karnaugh Map Essay Example | Topics and Well Written Essays - 500 words

Karnaugh Map - Essay Example In addition, the bottom right is marked (10) because positions A=1, B=0, C=1 and D=0, giving (f) a value of 10. After the construction, of the Karnaugh map, the minimum terms used in the final expression are sought. They are reached by circling groups of (1) in the map. These groups should be rectangular and have an area with a power of a prime numbers (Saxena, & Arora, 2009). Karnaugh maps help in detection and elimination of race hazards, which become easy to detect using the Karnaugh map. A race condition exists when moving between adjacent pairs. For instance, when (C) =1 and (D) = 0 in the map, (A) = 1 and (B) changes to 0. As a result, the output does not change, but potential for a glitch exists. Minimum logical functions have crucial applications in designing logical circuits. Finding the minimum logical function is solved by using different methods, most of which are not suitable for computer implementation. Laws of Boolean algebra simplified by the Karnaugh map have a wide application in minimization of the logical functions. The map represents an efficient tool for minimizing logical functions with less than six variables (Seda, 2008). The Gray Code or the reflected binary code represents a binary numbering system in which two consecutive values vary in only a single bit. This code is non-weighted. The invention of the code served to prevent spurious electromechanical switches output. Currently the Gray Codes have a wide application in facilitation of error collection and digital communication. In the Gray code numbering system, the device utilizes natural binary codes. In this case, the positions may be close to one another. Disadvantages of the gray code lie with the real switches, which do not change state in synchrony. Transitions between the two states are preceded by a change in all the switches. As the switch change, at one point, they read a spurious position. The Gray Code