Scribd
Upload
42 views

Chapter 4 - Boolean Algebra-PART1

This document discusses combinational logic circuits and Boolean algebra. It begins by outlining the lesson outcomes, which are to derive sum of product and product of sum expressions, simplify expressions using Boolean algebra and DeMorgan's theorem, and draw circuits using only NAND and NOR gates. The document then explains how to design combinational logic circuits by defining the application in a truth table and deriving the simplified Boolean expression and circuit. It provides an example of designing a circuit to monitor water levels. Finally, it discusses deriving Boolean expressions from truth tables in sum of product and product of sum forms.

Uploaded by

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

Chapter 4 - Boolean Algebra-PART1

This document discusses combinational logic circuits and Boolean algebra. It begins by outlining the lesson outcomes, which are to derive sum of product and product of sum expressions, simplify expressions using Boolean algebra and DeMorgan's theorem, and draw circuits using only NAND and NOR gates. The document then explains how to design combinational logic circuits by defining the application in a truth table and deriving the simplified Boolean expression and circuit. It provides an example of designing a circuit to monitor water levels. Finally, it discusses deriving Boolean expressions from truth tables in sum of product and product of sum forms.

Uploaded by

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

CHAPTER 3

(PART 1)
COMBINATIONAL LOGIC CIRCUITS
& BOOLEAN ALGEBRA
LESSON OUTCOMES
• At the end of this lesson, the students should
be able to:
 Derive the Sum of Product (SOP) and Product of
Sum (POS) expression.
 Simplify the expression using Boolean Algebra
and theorem DeMorgan.
 Draw the circuit using only NAND and NOR
gates.
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
• The purpose of studying combinational logic
circuits is to design circuits to perform specific
logic functions as required by applications.
• The circuits are constructed by connecting
together logic gates.
• To design a logic circuit, the application must
be defined in a truth table.
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
• E.g: Design a logic circuit to monitor the water
level at a river bank. The buzzer Y will be
activated if the water level is below level A or
above the level B.
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
• There three steps in designing a combinational
logic circuits:
 Derive the truth table.
 Derive the simplified Boolean expressions.
 Draw the circuit.
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
1) Derive truth table
 A truth table contains all possible input
combinations and the output for each input
combination.
 The circuit has 2 inputs, float switches A and B
and a buzzer Y as its output.
 The logic levels to represent the input and output:
Input Output
Float off = 0 Buzzer on = 1
Float on = 1 Buzzer off = 0
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
 There are four input combinations: 00, 01, 10 and
11.
• AB = 00 : The water level is below A. Y=1
• AB = 10 : The water level is between A and B. Y=0
• AB = 11 : The water level is above B. Y=1
• AB = 01 : The float B is not functioning. Y=0
 The truth table:
DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
2) Derive the simplified Boolean expression
 The Boolean expression for Y can be written as:

3) Draw the circuit


DESIGNING A COMBINATIONAL LOGIC
CIRCUITS
• Suppose we add another output L to warn that
the float B is not functioning.
• The truth table has 2 outputs as shown below.
• The Boolean expression is
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• From a truth table, we can write two forms of
logic or Boolean expressions:
 Sum of Product (SOP)
 Product of Sum (POS)
• Sum of Product (SOP) expression
 The sum of all product terms when the output is a
logic 1.
 A product term is formed by ANDing the
complemented or uncomplemented input variables.
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
 Product terms for 2 variables truth table:
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• E.g: Derive SOP expression from the OR gate truth
table.

OR gate Truth Table

• There are three outputs where the output Y=1.


• The SOP expression is .
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• Product of Sum (POS) expression
 The product all sum terms when the output is a
logic 0.
 A sum term is formed by ORing the complemented
or uncomplemented input variables.
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
– Sum terms for 2 variables truth table:
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• E.g: Derive POS expression from the OR gate truth table.

OR gate Truth Table

• Only one output where the output Y=0.


• The POS expression can be written as
DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• So, the Boolean expression for an OR gate can
be written in two forms:
 SOP expression:
 POS expression:

OR gate Truth Table


DERIVING A BOOLEAN EXPRESSION
FROM A TRUTH TABLE
• The two forms of Boolean expression for the
truth table in section 3.1 can be written as
follows:
 SOP expression:
 POS expression:
Exercises
1. Given the truth table as shown below:
A B C Y

0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
a) Write the sum-of-product (SOP) expressions for Y
b) Write the product-of-sum (POS) expressions for Y
Solution:
a) The sum-of-product (SOP) expressions for Y:

b) The product-of-sum (POS) expressions for Y:


END OF CHAPTER 3
(PART 1)
COMBINATIONAL LOGIC CIRCUITS
& BOOLEAN ALGEBRA

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy