Scribd
Upload
24 views5 pages

Boolean Algebra

The document provides an overview of Boolean algebra, including definitions of variables, complements, and literals, as well as standard forms of Boolean expressions like sum-of-products (SOP) and product-of-sums (POS). It outlines the laws and rules of Boolean algebra, such as simplification rules and De Morgan's Theorems, which facilitate the manipulation of logic expressions. Additionally, it discusses the application of these concepts in digital circuit design.

Uploaded by

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

Boolean Algebra

The document provides an overview of Boolean algebra, including definitions of variables, complements, and literals, as well as standard forms of Boolean expressions like sum-of-products (SOP) and product-of-sums (POS). It outlines the laws and rules of Boolean algebra, such as simplification rules and De Morgan's Theorems, which facilitate the manipulation of logic expressions. Additionally, it discusses the application of these concepts in digital circuit design.

Uploaded by

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

2.

5 Boolean Algebra
Just like normal algebra, Boolean algebra allows us to manipulate logic equation and
circuits by performing transformation and simplification. Variable, complement, and literal
are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
Any single variable can have a 1 or a 0 value. The complement is the inverse of a variable
and is indicated by a bar over variable (overbar). For example, the complement of the
variable A is A. If A = 1, then A = 0. If A = 0, then A = 1. The complement of the variable A
is read as "not A" or "A bar." Sometimes a prime symbol rather than an over bar is used to
denote the complement of a variable; for example, ̅ indicates the complement of B. A literal
is a variable or the complement of a variable.

2.5.1 Standard forms of Boolean expressions


All Boolean expressions, regardless of their form, can be converted into either of two
standard forms: the sum-of-products form or the product-of sums form. Standardization
makes the evaluation, simplification, and implementation of Boolean expressions much more
systematic and easier.
2.5.1.1 Sum-of-products form (SOP)
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:
1. ABC + ̅ B ̅
2. AB + ̅ B ̅ + ̅ ̅ + D
3. ̅ B+ C ̅ + EF + GK + H ̅
Each of these sum-of-products expressions consist 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. For example, in the sum-of-products
expression ABC + ̅B ̅ , the first AND product contains the variables A, B, and C in their
uncomplemented (not inverted) form. The second AND term contains A and C in their
complemented (inverted) 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 ̅̅̅̅T).
2.5.1.2 Product-of-Sums (POS)
Another general form for logic expressions is sometimes used in logic-circuit design.
Called 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:
1. (A + ̅ + C)(A + C)
2. (A + ̅ )(̅ + D)F
3. (A + C)(B + ̅ )( ̅ + C)(A + ̅ + ̅ )
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. It will,
however, occur from time to time in some logic circuits that have a particular structure.
2.5.2 Laws and rules of Boolean Algebra
2.5.2.1 Laws of Boolean Algebra
The basic laws of Boolean algebra are the commutative laws for addition and
multiplication, the associative laws for addition and multiplication, and the
distributive law for same as in ordinary algebra. The table below gives the laws of Boolean
algebra.

2.5.2.2 Rules of Boolean Algebra.


The following below are the rules of Boolean algebra:
Simplification of Boolean expressions

Rule 10: A + AB = A
This rule can be proved by applying the distributive law, rule 2, and rule 4
as follows:
A + AB = A( 1 + B) Factoring (distributive law)
=A∙1 Rule 2: (1 + B) = 1
=A Rule 4: A∙1 = A

Rule 11: A + A ̅ = A + B
This rule can be proved as follows:
A + ̅B = (A + AB) + ̅̅̅̅ Rule 10: A = A + AB
= (AA + AB) + ̅B Rule 7: A = AA
=AA +AB +A ̅ + ̅B Rule 8: adding A ̅ = 0
= (A + ̅)(A + B) Factoring
= 1∙(A + B) Rule 6: A + ̅ = 1
=A + B Rule 4: drop the 1

Rule 12: (A + B)(A + C) = A + BC


This rule can be proved as follows:
(A + B)(A + C) = AA + AC + AB + BC Distributive law
= A + AC + AB + BC Rule 7: AA = A
= A( 1 + C) + AB + BC Rule 2: 1 + C = 1
= A∙1 + AB + BC Factoring (distributive law)
= A(1 + B) + BC Rule 2: 1 + B = 1
= A∙1 + BC Rule 4: A . 1 = A
= A + BC

2.5.3 De Morgan’s Theorem

DeMorgan, a mathematician who knew Boole, proposed two theorems that


are an important part of Boolean algebra. In practical terms, DeMorgan's theorems provide
mathematical verification which allows us to exchange OR operation with AND operation
and vice versa. Applying De’Morgan, we can also simplify Boolean expression in many
cases. One of DeMorgan's theorems is stated as follows: “The complement of a product of
variables is equal to the sum of the complements of the variables, or The complement of
two or more ANDed variables is equivalent to the OR of the complements of the
individual variables”. Summarily, De Morgan’s theorem gives the following advantages:

- De Morgan’s theorem is very useful in digital circuit design

- It allows ANDs to be exchanged with ORs by using invertors

- De Morgan’s theorem can be extended to any number of variables


2.5.3.1 De Morgan’s laws

The following below are De Morgan’s laws:

 Theorem 1 ̅̅̅̅̅̅̅̅̅ = ̅ + ̅
 Theorem 2 ̅̅̅̅̅̅̅̅̅̅ = ̅ ∙ ̅

N/B: (When carrying simplification using the De Morgan’s laws, we remember to break the
bar and change the operator)

Examples:

Simplify the following De Morgan’s theorem:

1, Z= (𝐴̅ + C) ∙ (B + 𝐷
̅ ) → A𝑪̅ + 𝑩
̅D

2, F = ̅̅̅̅̅̅̅
𝐴 𝐵+𝐴 ̅̅̅̅̅̅̅
𝐶
=𝐴 𝐵∙𝐴 𝐶
=A∙B∙A∙C
=A∙B∙C
2.5.3.2
Mapping Boolean expressions to logic gates

Z = (A∙B) ⊕ (C+D)

Z=A∙B∙̅̅̅̅̅̅̅̅̅̅ + ̅̅̅̅̅̅̅̅̅∙(C+D)

= A∙B∙ ̅ ∙ ̅ + ( ̅ + ̅ ) ∙ (C+ D)

= A∙B∙ ̅ ∙ ̅ + ̅ ∙C + ̅ ∙D + ̅ ∙C + ̅ ∙D

You might also like