LOGICGATES-UniMAPPortal.docVIP

LAB 2: BOOLEAN ALGEBRA AND CIRCUIT SIMPLIFICATION OBJECTIVES To implement combinational logic circuits using AND, OR and Inverter gates. To use Boolean theorems and DeMorgan’s theorem in circuit simplification. EQUIPMENTS/COMPONENTS Logic gates ( 74XX-series ) Switches Light Emitting Diodes INTRODUCTION Boolean algebra is the mathematical foundation of digital systems. In Boolean algebra there are three basic operations: OR, AND and NOT which can represent the three basic logic gates: OR, AND and Inverter gates respectively. In the other words, every Boolean expression has an equivalent gate description, and vice versa. The combination of logic gates is called as combinational logic circuit. In designing a combinational logic circuit, it is highly desirable to find the simplest implementation – that is, the one with the smallest number of gates or wires. One of the platforms to simplify the circuit is simplifying the logic expressions by using Boolean theorems and DeMorgan’s theorem. DeMorgans theorem gives a procedure for complementing a complex function. The complemented expression is formed from the original by replacing all literals by their complements, and ANDs become ORs and vice versa. This theorem indicates an interesting relationship between NOR, OR, NAND, and AND: In this experiment, you will investigate the application of Boolean theorems and DeMorgan’s theorem in circuit simplification. The combinational logic circuit diagram or Boolean expression will be given during the laboratory session. Note: Boolean theorems and DeMorgan theorem are listed in Appendix 2. ACTIVITY SHEET Step 1: Draw a logic diagram for the given expression; or, Examine the given logic circuit, and write the Boolean expressions for function F(A,B,C). Note: You will be given the combinational logic circuit diagram or the Boolean expression during the laboratory session. Step 2: Construct the circuit in Step 1. Connect toggle switches to inputs A, B, C, and a LED to the circu