Mapping out switching techniques

Several techniques can be used to minimize Boolean functions; some are more useful than others. This article deals with a computer program designed for two such techniques: the Karnaugh map and Quine-McCluskey (1952). The program demonstrates 24 switching variables. It provides a visual representation of the Karnaugh map technique for the user who wishes it. The second technique, Quine-McCluskey, provides the user with a list of the prime implicants. The architecture of digital computers, especially those for microcomputers, uses a design technique essential to any digital machine. This technique is referred to as digital logic. It includes the mathematics of Boolean algebra that generates Boolean equations, the topology and interaction of logic circuits, and the methods of minimizing logical equations. Boolean algebra is considered the basis of nearly all design and analysis methods in digital systems. The Boolean function can be described using various models. A few of these methods may be considered successful, but most have severe limitations. They all become unmanageable as the number of switching variables becomes larger.