LAB4-CombinationalLogicCircuitSimplification.PDFVIP

LAB 4-Combinational Logic Circuit Simplification OBJECTIVES: • Derive Boolean expressions from combinational logic circuits • Design combinational logic circuits from Boolean expressions • Simplify combinational logic circuits by applying Boolean algebra theorems and postulates MATERIALS: • 74LS04 Hex Inverting Gates IC in a 14-pin DIP • 74LS08 AND gate IC in a 14-pin DIP • 74LS32 OR gate IC in a 14-pin DIP • Power supply • LED DISCUSSION: Combinational logic circuits use two or more of the basic logic gates discussed in Lab 1: Basic Gates to create more useful, but complex, functions. When designing digital systems using combinational logic, a designer usually starts with a simple logic gate arrangement and finishes with a very complex combination of many gates. Some of these gates may even share the same inputs. It is at this point that he/she has to evaluate the circuit and see if there are any ways that the number of gates used can be reduced without changing the functionality of the circuit. By reducing the number of gates in a circuit, and keeping its functionality intact, a designer can dramatically cut cost and improve performance reliability. Boolean Algebra The process of simplifying combinational logic circuits is called reduction, and is achieved using the laws and theorems of Boolean algebra. In 1854, English mathematician George Boole invented a two-valued algebraic system, which we now know as Boolean algebra. This system was later adapted to analyze and describe the behavior of circuits by Bell Labs researcher Claude E. Shannon in 1938. Table 1 lists the laws and theorems of Boolean algebra that are commonly used for combinational logic circuit reduction.