Scribd
Upload
179 views13 pages

DLD Lab 4

The document describes an experiment on Boolean expression simplification and logic circuit implementation. The objectives are to understand Boolean algebra in logic circuits, write logic equations from diagrams, and simplify expressions using K-maps. The experiment involves simplifying Boolean expressions, obtaining truth tables, drawing logic diagrams, and implementing circuits on a trainer board. Tasks include simplifying an expression using steps and a K-map, writing the logic for a circuit diagram and simplifying, and expressing a function as a sum of minterms and simplifying using a K-map. The conclusion is that the experiment demonstrates how to simplify complex equations into simpler ones using Boolean algebra and verify that truth tables remain the same.

Uploaded by

KING Bot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
179 views13 pages

DLD Lab 4

The document describes an experiment on Boolean expression simplification and logic circuit implementation. The objectives are to understand Boolean algebra in logic circuits, write logic equations from diagrams, and simplify expressions using K-maps. The experiment involves simplifying Boolean expressions, obtaining truth tables, drawing logic diagrams, and implementing circuits on a trainer board. Tasks include simplifying an expression using steps and a K-map, writing the logic for a circuit diagram and simplifying, and expressing a function as a sum of minterms and simplifying using a K-map. The conclusion is that the experiment demonstrates how to simplify complex equations into simpler ones using Boolean algebra and verify that truth tables remain the same.

Uploaded by

KING Bot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 13

AIR UNIVERSITY

DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

EXPERIMENT NO 4

Lab Title: Boolean Expression Simplification and Implementation.


Student Name: M HAMZA AMIN Reg. No: 191862

Objective: To understand the utilization of Boolean algebra in logic circuits.


To write logic equation of a logic circuit from the logic diagram.
Simplification of Boolean Expression using K-Map.

LAB ASSESSMENT:

Excellent Good Average Satisfactory Unsatisfactory


Attributes (5) (4) (3) (2) (1)
Ability to Conduct
Experiment
Ability to assimilate the
results
Effective use of lab
equipment and follows
the lab safety rules

Total Marks: Obtained Marks:

LAB REPORT ASSESSMENT:

Excellent Good Average Satisfactory Unsatisfactory


Attributes
(5) (4) (3) (2) (1)

Data presentation

Experimental results
Conclusion

Total Marks: Obtained Marks:

Date: Mark Signature:

EXPERIMENT 04

Boolean Expression Simplification and Implementation

Objectives:
 To understand the utilization of Boolean algebra in logic circuits.
 To write logic equation of a logic circuit from the logic diagram.
 Simplification of Boolean Expression using K-Map.

Equipment required:
 TTL IC-7408
 TTL IC-7432
 TTL IC-7404
 TTL IC-7400
 TTL IC-7402
 TTL IC-7486
 Digital Electronics Trainer

Task 1:
Simplify the given expression and follow the given steps to verify the circuit.

F = (X’Y’+Z)’ + Z + XY + WZ

Steps:
1. Obtain the truth table for the expression given above.
2. Simplify the Expression using Boolean algebra.
3. Draw the logic diagram for the simplified expression.
4. Implement the circuit on trainer using the required logic gates and verify your circuit by applying
all the possible input combinations to the circuit.
Simplified Expression:

Logic Diagram:

Truth Table:
Inputs Output

W X Y Z F
0 0 0 0 0

0 0 0 1 1

0 0 1 0 1

0 0 1 1 1

0 1 0 0 1

0 1 0 1 1
0 1 1 0 1

0 1 1 1 1

1 0 0 0 0

1 0 0 1 1

1 0 1 0 1

1 0 1 1 1

1 1 0 0 1

1 1 0 1 1

1 1 1 0 1

1 1 1 1 1
Simulation Results:
Task 2:
Steps:
1. Write the Logic expression for the circuit.
2. Simplify the expression using Boolean algebra.
3. Obtain the truth table for the simplified expression.
4. Draw a new logic diagram for the simplified expression.
5. Implement the circuit on trainer using the required logic gates.
6. Verify your circuit by applying all the possible input combinations to the circuit.

Logic Expression:

Simplified Expression:

X=B+B•C+A•B+A•C+A•B•C

B + B•C = B, so

X = B + A•B + A•C + A•B•C as

B + A•B = B, so

X=B+A•C+A•B•C

Using Commutative law 1a: B + A•C + A•B•C = B + A•B•C + A•C

X=B+A•B•C+A•C

B + A•B•C = B, so

X=B+A•C

X=B+A•C
Logic Diagram for the Simplified Expression:

Truth Table:

Inputs Output

A B AC X
0 0 0 0

0 0 0 0

0 1 0 1

0 1 0 1

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 1

Simulation Results:
Task 3:
Expression:

F=A’C+A’B+AB’C+BC
Steps:
1. Express the above mentioned expression in the form of sum of minterms.
2. Draw the K-Map for the function.
3. Find its simplified expression from K-map in SOP form.
4. Draw the logic diagram for the simplified expression.
5. Obtain a truth table for the simplified expression.
6. Implement the logic circuit on trainer using the required logic gates.
7. Verify your logic circuit by applying all the possible input combinations to the circuit.

Canonical Form:

F = ∑ (1,2,3,5,7)

K-MAP:

Simplified Expression:

F=C+A’B

Truth Table:

Inputs Output

A B C A’B F
0 0 0 0 0

0 0 1 0 1

0 1 0 1 1

0 1 1 1 1

1 0 0 0 0

1 0 1 0 1

1 1 0 0 0

1 1 1 0 1
Logic Diagram:

Simulation Results:
Conclusion:
 After doing this experiment,we get to know how to simplify the complex circuit equation
into a simpler ones by using different Boolean expression.
 We see that the truth tables of both complex circuit and simplified one are same.It means
that we can use the simpler one for our ease.
 We get to know how to simplify the circuit by using K-Map.

You might also like