Scribd
Upload
31 views

12 Logic Expression

The document describes an experiment to realize a logic expression using combinational logic circuits. The expression is simplified using a Karnaugh map from a given truth table. The simplified expression is then implemented using AND, OR, and NOT gates with the output connected to an LED. Proper connections and a 5V power supply are needed to ensure the LED lights up only for the specified input combinations.

Uploaded by

Alamgir Kabir Shuvo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
31 views

12 Logic Expression

The document describes an experiment to realize a logic expression using combinational logic circuits. The expression is simplified using a Karnaugh map from a given truth table. The simplified expression is then implemented using AND, OR, and NOT gates with the output connected to an LED. Proper connections and a 5V power supply are needed to ensure the LED lights up only for the specified input combinations.

Uploaded by

Alamgir Kabir Shuvo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

EXP # 12 REALIZATION OF LOGIC EXPRESSION USING COMBINATIONAL LOGIC

Theory :
Basic logic circuits are divided into two broad classes: Combinational logic circuit 1. Sequential logic circuit In combinational logic circuits, the output of any instant only depends on the input present at the instants, ie there is no scope for memory in the circuits. In this experiment we are using these types of circuits. Once the expression for a logic circuit has been obtained, We may be able to reduce it to a simpler form containing fewer terms or fewer variable in one or more terms. The new expression then can be used to implement a circuit that is equivalent to the original circuit but that contains fewer gates and connections. We can do this by using boolean algebra theorems. This needs two essential steps: 1. The original expression is put into SOP form by repeated application of DeMorgans theorems and multiplication of terms. 2. Once the original expression is in SOP form, the product terms are checked for common factors and factoring is performed wherever possible. Hopefully, the factoring results in the elimination of one or more terms. Or, we can also reduce the real expression by using Karnaugh map. The steps below are followed in using the K-map method for simplifying a Boolean expression: 1. Construct the K-map and place 1s in those sequences corresponding to the 1s in the truth table and place 0s in the other squares. 2. Examine the map for adjacent 1s and loop those 1s which are not adjacent to any other 1s. 3. Next, look for those 1s are adjacent to only one other 1. Loop any pair containing such 1s. 4. Loop any octet even if it contains some 1s that have already been looped. 5. Loop any quad even if it contains one or more 1s that have not already been looped, making sure to use the minimum number of loops. 6. Loop any pairs necessary to include any 1s that have not yet been looped, making sure to use the minimum number of loops. 7. Form the OR sum of all the terms generated by each loop. The truth table, which we will be working on, is like below: A 0 0 0 0 1 1 1 1 Apparatus: 1. 2. 3. B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Result 1 0 1 1 1 0 0 1 Expression ___ ABC _ _ ABC _ ABC __ ABC ABC

7408 (two input AND gate), 7404 (NOT gate), 7432 (two input OR gate) ICs Connecting wire Breadboard

4. 5 volt dc power supply 5. LED Realization: From the truth table we can write: Result, D = A BC + ABC + ABC + A BC + ABC The realization of the given expression using the ICs with the pin connections and LED connection are made. The LED is lighted only for those inputs which satisfied the given expression. There are only five conditions to be satisfied. For For For

For For Proper realization for only these five combinations, the LED should lighted on. Simplification: K-map for this truth table is like below: C AB _ AB __ AB _ AB From the K-map we can reduce it to: D = BC + AB + BC A B C 1 1 0 0 _ C 0 1 1 1

A BC term --- terminate all the input to zero ABC term --- terminal A to zero other to Vcc ABC term --- terminals A & c to zero and B to Vcc A BC term --- terminals B & c to zero and A to Vcc ABC term --- All terminals to Vcc

D=

Precaution: 1. The DC supply should be fixed at 5 volt. 2. All ICs should be checked first. 3. The ICs should be placed in the bread board perfectly and carefully. 4. LED should be checked too. Discussion: We should always check the DC supply whether it is at 5 volt level. If this is not maintained the ICs would be burned off for high voltage or LED will not be lighted for the inputs. We also need to get sure that all the ICs are connected to Vcc and ground with proper pins.

You might also like