Scribd
Upload
5 views

Lecture 4

Uploaded by

obielumpraise
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Lecture 4

Uploaded by

obielumpraise
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

EEG 224

Lecture 4
Boolean Theorems
• We have seen how Boolean algebra can be used to help analyze a logic
circuit and express its operation mathematically
• Boolean theorems (rules) help us to simplify logic expressions and logic
circuits in Boolean algebra.
• The first group of theorems is given in the Figure in the next page.
• In each theorem, x is a logic variable that can be either a 0 or a 1.
• Each theorem is accompanied by a logic-circuit diagram that demonstrates
its validity.
First set of Boolean Theorems with one variable
Boolean Theorems with more than one variable

(9) � + � = � + � commutative laws


(10) �. � = �. � commutative laws
(11) � + (� + �) = (� + �) + � = � + � + � associative laws
(12) �(��) = (��)� = �yz associative laws
(13a) �(� + �) = �� + xz distributive law
(13b) (� + �)(� + �) = �� + �� + �� + �� distributive law
(14) � + �� = �
(15a) � + �� = � + �
(15b) � + �� = � + �
Summary of Boolean Theorems

All of these Boolean theorems can be useful in simplifying a logic


expression—that is, in reducing the number of terms in the expression.
Example 1
Example 2
Practice Question
DeMorgan’s Theorems
• Two of the most important theorems of Boolean algebra were contributed
by a great mathematician named DeMorgan.
• These theorems are useful in simplifying expressions in which a product or
sum of variables is inverted.
• The two theorems are:
Example:
• DeMorgan’s theorems are easily extended to more than two variables.

• We can easily show that DeMorgan’s Theorem is true e.g.


Example 2:
• Simplify the expression from the circuit using DeMorgan’s theorems.
Assignment: Submit before next class
1. Write the expression for the output of Figure below, and use it to determine
the complete truth table.

2. Simplify each of the following expressions using DeMorgan’s theorems


• In previous lectures, we studied the operation of all the basic logic gates.
• We used Boolean algebra to describe and analyze circuits that were
made up of combinations of logic gates.
• These circuits can be classified as combinational logic circuits because,
at any time, the logic level at the output depends on the combination of
logic levels present at the inputs.
• A combinational circuit has no memory characteristic, so its output
depends only on the current value of its inputs.
• We will begin by studying the simplification of combinatorial logic
circuits.
• Two methods will be used: one uses Boolean algebra theorems; the
other uses a mapping technique called Karnaugh Mapping.
Sum-of-Product Expression
• The methods of logic-circuit simplification and design that we will study
require the logic expression to be in a sum-of-products (SOP) form.
• Some examples of this form are:

• Each of these sum-of-products expressions consists of two or more AND


terms (products) that are ORed together.
• Each AND term consists of one or more variables individually appearing in
either complemented or uncomplemented form.
• Note that in a sum-of-products expression, one inversion sign cannot cover
more than one variable in a term (e.g., we cannot have ��� or ���).
Product-of-Sums Expression
• Another general form for logic expressions is the product-of-sums (POS) form.
• It consists of two or more OR terms (sums) that are ANDed together.
• Each OR term contains one or more variables in complemented or
uncomplemented form.
• Here are some product-of-sum expressions:

• The methods of circuit simplification and design that we will be using are
based on the sum-of-products form, so we will not be doing much with the
product-of-sums form.
Simplifying Logic Circuits
• From the expression for a logic circuit, we may be able to reduce it to a
simpler form containing fewer terms or fewer variables in one or more terms.
• To illustrate, the circuit of Figure (a) can be simplified to produce the circuit of
Figure (b).

• The simpler circuit is more desirable because it contains fewer gates and will
therefore be smaller and cheaper.
• So do we achieve this simplification?
Algebraic Simplification
• We can use the Boolean algebra theorems discussed in previous
lecture to help us simplify the expression for a logic circuit.
• Usually simplification contain two essential steps:
• The original expression is put into SOP form by repeated application
of DeMorgan’s theorems and multiplication of terms.
• Once in SOP form, the product terms are checked for common
factors, and factoring is performed wherever possible.
• Consider the following example.
Example 1
• Simplify the logic circuit shown in Figure (a).

Solution
• First find the expression for the output if not given. Here we are given:
• With the expression now in SOP form, we look for common variables among
the various terms with the intention of factoring.

• This result can be simplified no further. Its circuit implementation is shown


in Figure (b).
Example 2
Practice the following on your own:

You might also like