3.

2 Boolean Algebra
Boolean algebra is a convenient and systematic way of
expressing and analyzing the operation of logic circuits
o This class session covers the laws, rules and theorems of
Boolean algebra and their application to digital circuits
We will learn to simplify the logic circuits using the methods
of Boolean algebra and Karnaugh maps
Boolean algebra is an important mathematical tool for
designing and analysing digital systems
" A basic knowledge of Boolean Algebra is indispensable to
the study and analysis of logic circuits
" As in other areas of mathematics, there are certain well
developed rules and laws that must be followed in order to
apply Boolean Algebra properly
DeSALBEKT ALEXANDERSEECE

Rules of Boolean Algebra

A+AB=A
A+ ÄB=A+B
" (A+B)(A+C)=A+BC
DeSALREKT ALEXANDERSEECT
VIT

Rules of Boolean Algebra

Exercise 1
Simplify A+AB.
SOLUTION
" A+AB = A (1+B) ’ Factoring (distributive law)
o = A.1 ’ Rule 4: (1+B) = 1
=A’ Rule 2: A.1= A
 Exercise 2
Simplify and show that A+ AB=A+B.
SOLUTION
"A+ (A+AB)+ ’ Rule 10: A+AB=A
" (AA+AB) + B’ Rule 7: A.A=A
" AA+AB+A.A +AB ’ Rule 8: A. =0
" (A+ ) (A+B) ’ Factoring (distributive law)
" 1.(A+B) ’ Rule 6: A+A =1
A+B ’ Rule 2> A.1=A

DSALBKI ALEXANDERSLECE
VIr

Exercise3
Simplify and show that (A+B) (A+C) = A+BC.
sOLUTION
" (A+B) (A+C) = AA + AC+ AB + BC Distributive law
=A+AC + AB +BC ’ Rule 7: AA =A
=A (1+C)+ AB+ BC ’ Factoring (distributive law)
= A.1+AB +BC’ Rule 4: 1+C =1
=A (1+B) + BC ’Factoring (distributive law)
=A. 1+ BC ’ Rule 4: 1+B =1
= A+ BC ’ Rule 2: A.1 =A

DSALBEKT ALEXANDERSEECE

Exercise 5
Simplify the expression ABD+ABD.
sOLUTION
" ABD+ABD.
" AB(D+ D) ’ Distributive law
" AB(1) ’ Rule 5: D+ D=1
" AB ’ Rule 2: A.1 =A
 Exercise 6
Convert the following Boolean expressions to SOP form:
(A+B)(C+ B)
SOLUTION:
a) (A+B)(C+ B) = AC+AB +BC+BB
= AC+AB +BC+0
= AC+AB +BC

DrS.ALBERT ALEXANDER-SELECT
VIT 14

Standard SOP
* ABCD+ A
BCD+ ABCD is a standard SOP form because
all the four variables A,B,C and D appear in each product
term in the expression
SOP expression in which some of the product terms do
not contain all of the variables in the domain, is called
non-standard sum-of-products expression
* For example, the expression ABC+ABD +ABCD has a
domain made up of four variables A,B,C and D
o From the expression find that the first two terms (i.e. ABC -
’D or Dis missing and ABD’ C orC is missing) does not
have a complete set of four variables in the domain
* Standard sum-of-product expressions are important in
constructing truth tables and in K-map simplification
DrS.ALBERT ALEXANDERSELECT
VIT 15

Exercise 7
Convert the Boolean expression ABC+ BC +AD to a
standard sum-of products (SOP) form.
SOLUTION
* ABC+ BCD +ACD
" ABC = ABC(D+ D)= ABCD+ ABCD
" BCD = BCD (A+ ABCD+ BCD
* ACD =ACD (B+B)= ABCD+ ABCD
Thus the standard SOP (i.e. sum-of-products) form of the
given expression:
= ABCD+ ABCD+ ABCD+ BCD +ABCD + ABCD
 Binary Representation
" Standard product term is equal to 1 for only one
combination of variable values
o For example the product term ABCD is equal to 1 when A=
1, B=0,C=1 and D=0
o The product term ABCD is 0 for all other combinations of
values for the variables
" ABCD =1010=1.1.1.1=1
" Note that the product term ABCD has a binary value 1010
(i.e. decimal 10).
* A product term is implemented with an AND gate whose
output is 1 if and only if each of its inputs is1
* INVERTERS are used to produce the complements of the
variables wherever required
DrS.ALBERT ALEXANDER-SELECT
VIT 17

Exercise 8
Determine the binary values for which the following sum-of
products (SOP) expression is equal to 1.
ABCD+ABCD+ BCD
SOLUTION
" We know that the given SOP expression is equal to 1 when
any or all of the three product terms are equal to 1
The product term ABCD is equal to 1 when A=1, B=0,C=1,
and D = 1, i.e., ABCD =1.0.1.1 =1.1.1.1=1
o The term ABCD is equal to 1 when A=1, B=1,C=0 and
D=1, ie., ABCD =1.1.0.1=1.1.1.1=1
o The term ABCDisequal to 1 when A = 0, B= 0, C =0and
D= 0, i.e., ABCD = 0.0.0.0 =1.1.1.1=1
DeS.ALBERT ALEXANDER-SELECT
 DOOIedi aigebTa

DeSALBERT ALEXANDER-SELECT
VIT 22

Exercise 9
Convert the Boolean expression (A+B) (B+C) to a standard
product-of-sums (POS) form.
sOLUTION
(A+B) (B+C)
(A+B) =(A+B) (C+C)= (A+B+C)+ (A+B+C)
" (B+C) = (B+C)(A+ (A+B+C) (A+B+C)

Thus the standard product-of-sums (POS) form of the given

DrSALBERT ALEXANDER-SELEC:
23

Binary Representation
Standard sum term is equal to 0 for only one combination
of variable values
For example the sum term A+B+C+Dis equal to 0 when A
=0, B = 1,C= 0and D=1
" The sum term A+B+C+D is 1 for all other combinations of
values for the variables
A+B+C+D= 0101 =0.0.0.0=0
* Note that the sum term A+B+C+D has a binary value 0101
(i.e. decimal 5)
o A sum term is implemented with an OR gate whose output
is Oif and only if each of its inputs is 0
" INVERTERS are used to produce the complements of the
variables wherever required
DeSALHERT ALEXANDERSELECT
VIr 24

Exercise 10
Determine the binary values for which the following product
of-sums (POS) expression is equal to 0.
(A+B+C+D) (A+B+C+D) ( D)
sOLUTION
" We know that the given POS expression is equal to 0 when
any or all of the three product terms are equal to 0
* The term (A+B+C+D) is equal to 0 when A=0, B=1,C=0,
and D = 0, i.e., (A+B+C+D) =0+1+0+0 =0+0+0+0=0
o The term (A+B+C+D) is equal to 0 when A=0, B=0,C=1
and D=0, i.e., (A+B+C+D) =0+0+++0= 0+0+0+0=0
* The term (A+B+C+ D) is equal to 1 when A = 1, B= 1,C=
1and D= 1, i.e., (A+B+C+ D) =1+1+1+1 =0+0+0+0=0
DeS.ALBERT ALEXANDER-SELECT
25
 1and D=1, ie., (A+B+0C+ D) =1+1+1+1 =0+0+0+0=0
DrSALBERT ALEXANDERSELECT
VIn

Exercise 11
Convert into standard SOP and standard POS form:f=AB+BC
SOLUTION
SOP: AB- AB(C+C) = ABC+ ABC &BC- BC (A+Ã) = BA + BCÃ
AB+BC =ABC+ ABC+ ABC +
POS: ABC+ ABC + ABC + = 101 + 100 + 110 + 010
o There are 3 variables in the domain of this expression (i.e.
A, B and C), hence 2 (=8) possible combinations
o The given SOP expression contains four of these
combinations, so the POS must contain the other four
which are 000, 001, 011 and 111 Since these are binary
values that make the sum term 0, therefore the equivalent
POS expression is, ( (A+B+C) (A+B+C)(A+B+C)
DeSALBEERT ALEXANDERSELECT
VIT

Exercise 12
Find the maxterms for the expression: F = AC+ABC+
SOLUTION
Standard form: ABG+ AB C+ ABC+
Combining similar terms: ABC+ AB +
There are 3 variables in the domain of this expression (i.e.
A, B and C), hence 23 (=8) possible combinations
o The SOP contains three of these combinations, so the
POS must contain the other five which are 000,001, 010,
101 and 111
o Since these are binary values that make the sum term 0,
therefore the equivalent POS expression is, (A+B+C)
( ( B+C) (A+B+C)
DeSALBERT ALEXANDER-SELECT
27

Exercise 13
Transform the folowing canonical expression into its other
canonical form in decimal notation.(i) f (x, y, z) = X m(1, 3, 5).
SOLUTION
* f(x, y, z) = Im(1,3, 5)
* There are three variables x, y and z, then the total number
of term 29 (= 8)
" In the given SOP there are three terms, 1,3 and 5
o The POS form contain the remaining five term, 0, 2, 4, 6
and 7
The POS form of expression is given below :
" f (x, y, z) =M(0, 2, 4, 6, 7)

DeSALBERT ALEXANDER-SELECT
VIT 28
 Exercise 14
Transform the following canonical expression into its other
canonical form in decimal notation. (ii) f (w, x, y, z) = M (0, 2,
5,6, 7, 8, 9, 11, 12).
sOLUTION
* f (w, x, y, z) = M (0, 2, 5, 6, 7, 8, 9, 11, 12)
In the above expression there are four variables, w, x, y
and z, the total number of term 2 (= 16)
o The given function is form of POS and it contain nine
terms. 0, 2, 5, 6, 7, 8, 9,11 and 12
" The SOP form contain the remaining seven term, 1, 3, 4,
10, 13, 14 and 15
" The SOP form of expression is given below: f (w, x, y, z) =
m(1, 3, 4, 10, 13, 14, 15)
DeSALBERT ALEXANDER SELECT
VIT 29

Exercise 15
Determine, the POS and SOP form of Z = m(0, 1, 3, 6, 7,
8, 9, 13, 15)
SOLUTION
* The given function is form of min terms, so we directly find
out the SOP from the expression
" ABCD+ ABCD+ABCD + ABCD+
ABCD
" There are four variables in the domain of this expression
(i.e. A, B, C and D), there are total of 24 (=16) possible
combinations
o The SOP expression contains nine of these combinations,
So the POS must contain the other seven term. POS
terms= 0010 + 0100 + 0101 + 1010+ 1011 + 1100 + 1110
DeS.ALBERT ALEXANDER SELHCT
VIT 30