The process of learning digital techniques comprehends the domain of physical and logical structures of combinatorial circuits. For the logic structure, generally described by a Boolean function, is always important to get the simplest form that describes a digital circuit. The Karnaugh Maps [Katz 1995] are useful structures to minimize Boolean functions. Although not being the best way, computationally, to minimize logic functions, this structures are very important to understand how adjacent terms of equal value, when grouped, can reduce the number of minterms that comprehend the optimized final solution. KarMa is a very useful tool to learn Karnaugh Maps. It shows the visualization of a logic function simultaneously by a truth table and by the own Karnaugh Map. Among its functionalities, KarMa does the logical optimization of a given function with the use of the Quine-McCluskey algorithm, which execution is presented step by step to the user. The current version of this tool allows manipulation of 2 up to 8 entries. |