Scribd
Upload
113 views4 pages

Boolean Algebra & Logic Gates Lab

This document summarizes a lab report on Boolean algebra and logic gates. The objectives of the lab were to demonstrate algebraic simplification using postulates and theorems, analyze combinational logic circuits, and determine the relationship between sum of minterms and product of maxterms. The lab procedures involved drawing logic diagrams in Logisim, writing Boolean functions, simplifying expressions, and constructing circuits. Key results included simplifying the Boolean expression F = x'y'z + x'yz + xy' to F = x'y' + x'z, writing functions as sums of minterms and products of maxterms, and verifying simplified functions using truth tables. The conclusion was that the lab helped understand Boolean algebra

Uploaded by

Alecxis Caringal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
113 views4 pages

Boolean Algebra & Logic Gates Lab

This document summarizes a lab report on Boolean algebra and logic gates. The objectives of the lab were to demonstrate algebraic simplification using postulates and theorems, analyze combinational logic circuits, and determine the relationship between sum of minterms and product of maxterms. The lab procedures involved drawing logic diagrams in Logisim, writing Boolean functions, simplifying expressions, and constructing circuits. Key results included simplifying the Boolean expression F = x'y'z + x'yz + xy' to F = x'y' + x'z, writing functions as sums of minterms and products of maxterms, and verifying simplified functions using truth tables. The conclusion was that the lab helped understand Boolean algebra

Uploaded by

Alecxis Caringal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CpE 301 – Logic Circuits and Design

LABORATORY REPORT: EXERCISE 2 BOOLEAN ALGEBRA AND LOGIC GATES


Caringal, Alecxis T.
Computer Engineering, College of Engineering
Colegio San Agustin – Bacolod

I. INTRODUCTION

Combinational logic analysis refers to the act of deciphering the operation of a circuit
from its final logic diagram. This is a useful skill that can aid designers when debugging
their circuits. This can also be used to understand the timing performance of a circuit and to
reverse-engineer an unknown design.

Theorems of Boolean Algebra are a set of rules used with digital variables and logical
operations to develop, manipulate and simplify logical expressions. Boolean Algebra
provide systematic means for discovering alternative expressions. This laboratory exercise
will let you get familiarize with algebraic simplification, combinational logic circuit, sum of
minterms and product of maxterms.

II. OBJECTIVES

The objectives of this laboratory experiment are the following:


1. To demonstrate algebraic simplification using the Postulates and Theorems.
2. Able to analyze a combinational logic circuit to determine ist logic expression, and
truth table.
3. To determine the relationship between the sum of minterms is equal to the
product of max terms.

III. MATERIALS AND COMPONENTS

This chapter is about the presentation of the materials and components used in this
laboratory exercise.

All logic circuits in this laboratory exercise are designed and stimulated in Logisim
software package.

IV. PROCEDURE

This chapter will discuss about the laboratory exercise procedure.

Steps:
1. Draw the logic diagram using logism simulation software
2. Write the Boolean function.
3. Simplify the Boolean expression obtained.
4. Construct the circuit diagram.

V. RESULTS AND DISCUSSION

This chapter is about the presentation of the output that gathered based on the
laboratory exercise given.

1. Draw the logic diagram of the Boolean expression F = x’y’z + x’yz + xy’ using logisim
simulation software. And write the truth table of the expression.

Question: Simplify the Boolean expression F = x’y’z + x’yz + xy’ (procedure 1) and construct the
simplified circuit diagram using logisim simulation software. Write the truth table of the simplified
Boolean expression.

a. Logic Diagram
b. Truth Table

c. Simplified Boolean Expression

F = x’y’z + x’yz + xy’


=x y’ + x’z

2. Write the Boolean Function of Table 2 in the sum of minterms. Create the circuit diagram of
the obtained sum of minterms (SOP) using logisim simulation software.

Question: Simplify the Boolean Function (obtained from table 2) with the least number of literals
and Construct the circuit based on the simplified Boolean function using Logisim.

a. Circuit Diagram

b. Truth Table
c. Simplified Boolean Function

F=Σ(m0,m1,m2,m3,m4,m5,m6,m7) = (X’+Y’+Z’)

3. Write the Boolean Function of Table 3 in the product of maxterms. Create the circuit
diagram of the obtained product of maxterms (POS) using logisim simulation software.

Question: Simplify the Boolean Function (obtained from table 3) with the least number of literals
and Construct the circuit based on the simplified Boolean function using Logisim.

a. Circuit Diagram

b. Truth Table

c. Simplified Boolean Function

F=П(M0.M1,M2,M3,M4,M5,M6,M7) = (X’Y’Z’)

VI. CONCLUSION

This laboratory exercise broadens my knowledge about Boolean Algrebra and Logic
Gates. I learned how to simplify Boolean functions, obtain sum of minterms and product of
maxterms.
I was able to verify that the simplified Boolean function can be translated back into the
original logic circuit form and can perform the same functions with a fewer component. I also
understand the importance of minterm and maxterm which is it describes the variables in the
terms are true and which are complemented.

In conclusion, this laboratory exercise helped me to understand and learn about the
algebraic simplification using the postulates and theorems. I was able to analyze the
combinational logic circuit provided and determine the relationship between the sum of
minterms and product of maxterms.

References

[Link]

[Link]

You might also like