Chapter 2

Boolean Functions and Algebra

After studying Chapter 2, you should be able to:

* learn how to simplify Boolean expression using properties

* construct a table with the input/output behavior of each individual gate

* learn how to manipulate Boolean expression and simplify them using Canonical
and Standard Format

* learn how to simplify Boolean expression using K-Map Method

Boolean Algebra
Boolean Algebra is an algebra, which deals with binary numbers & binary variables. Hence, it is also
called as Binary Algebra or logical Algebra. A mathematician, named George Boole had developed this
algebra in 1854. The variables used in this algebra are also called as Boolean variables.
The range of voltages corresponding to Logic ‘High’ is represented with ‘1’ and the range of voltages
corresponding to logic ‘Low’ is represented with ‘0’.

Postulates and Basic Laws of Boolean Algebra

In this section, let us discuss about the Boolean postulates and basic laws that are used in
Boolean algebra. These are useful in minimizing Boolean functions.

Boolean Postulates

Consider the binary numbers 0 and 1, Boolean variable xx and its complement x′x′. Either the Boolean
variable or complement of it is known as literal. The four possible logical OR operations among these
literals and binary numbers are shown below.
x+0=x
x+1=1
x+x=x
x + x’ = 1
Similarly, the four possible logical AND operations among those literals and binary numbers are shown
below.
x.1 = x
x.0 = 0
x.x = x
x.x’ = 0
These are the simple Boolean postulates. We can verify these postulates easily, by substituting the
Boolean variable with ‘0’ or ‘1’.
Note− The complement of complement of any Boolean variable is equal to the variable itself. i.e., x′x
′’=x.
Basic Laws of Boolean Algebra

Following are the three basic laws of Boolean Algebra.

 Commutative law
 Associative law
 Distributive law

Commutative Law

If any logical operation of two Boolean variables give the same result irrespective of the order of those
two variables, then that logical operation is said to be Commutative. The logical OR & logical AND
operations of two Boolean variables x & y are shown below
x+y=y+x
x.y = y.x
The symbol ‘+’ indicates logical OR operation. Similarly, the symbol ‘.’ indicates logical AND
operation and it is optional to represent. Commutative law obeys for logical OR & logical AND
operations.

Associative Law

If a logical operation of any two Boolean variables is performed first and then the same operation is
performed with the remaining variable gives the same result, then that logical operation is said to
be Associative. The logical OR & logical AND operations of three Boolean variables x, y & z are shown
below.
x + y+zy+z = x+yx+y + z
x.y.zy.z = x.yx.y.z
Associative law obeys for logical OR & logical AND operations.

Distributive Law
If any logical operation can be distributed to all the terms present in the Boolean function, then that
logical operation is said to be Distributive. The distribution of logical OR & logical AND operations of
three Boolean variables x, y & z are shown below.
x.y+zy+z = x.y + x.z
x + y.zy.z = x+yx+y.x+zx+z
Distributive law obeys for logical OR and logical AND operations.
These are the Basic laws of Boolean algebra. We can verify these laws easily, by substituting the
Boolean variables with ‘0’ or ‘1’.

Simplification of Boolean Functions

Till now, we discussed the postulates, basic laws and theorems of Boolean algebra. Now, let us simplify
some Boolean functions.

Example 1

Let us simplify the Boolean function, f = p’qr + pq’r + pqr’ + pqr

We can simplify this function in two methods.

Method 1
Given Boolean function, f = p’qr + pq’r + pqr’ +pqr.
Step 1 − In first and second terms r is common and in third and fourth terms pq is common. So, take the
common terms by using Distributive law.
⇒ f = p′q+pq′p′q+pq′r + pqr′+rr′+r
Step 2 − The terms present in first parenthesis can be simplified to Ex-OR operation. The terms present
in second parenthesis can be simplified to ‘1’ using Boolean postulate
⇒ f = p⊕qp⊕qr + pq11
Step 3 − The first term can’t be simplified further. But, the second term can be simplified to pq
using Boolean postulate.
⇒ f = p⊕qp⊕qr + pq
Therefore, the simplified Boolean function is f = p⊕qp⊕qr + pq
Method 2
Given Boolean function, f = p’qr + pq’r + pqr’ + pqr.
Step 1 − Use the Boolean postulate, x + x = x. That means, the Logical OR operation with any Boolean
variable ‘n’ times will be equal to the same variable. So, we can write the last term pqr two more times.
⇒ f = p’qr + pq’r + pqr’ + pqr + pqr + pqr
Step 2 − Use Distributive law for 1st and 4th terms, 2nd and 5th terms, 3rd and 6th terms.
⇒ f = qrp′+pp′+p + prq′+qq′+q + pqr′+rr′+r
Step 3 − Use Boolean postulate, x + x’ = 1 for simplifying the terms present in each parenthesis.
⇒ f = qr11 + pr11 + pq11
Step 4 − Use Boolean postulate, x.1 = x for simplifying the above three terms.
⇒ f = qr + pr + pq
⇒ f = pq + qr + pr
Therefore, the simplified Boolean function is f = pq + qr + pr.
So, we got two different Boolean functions after simplifying the given Boolean function in each method.
Functionally, those two Boolean functions are same. So, based on the requirement, we can choose one of
those two Boolean functions.

Example 2

Let us find the complement of the Boolean function, f = p’q + pq’.

The complement of Boolean function is f’ = p′q+pq′p′q+pq′’.
Step 1 − Use DeMorgan’s theorem, x+yx+y’ = x’.y’.
⇒ f’ = p′qp′q’.pq′pq′’
Step 2 − Use DeMorgan’s theorem, x.yx.y’ = x’ + y’
⇒ f’ = {p′p′’ + q’}.{p’ + q′q′’}
Step3 − Use the Boolean postulate, x′x′’=x.
⇒ f’ = {p + q’}.{p’ + q}
⇒ f’ = pp’ + pq + p’q’ + qq’
Step 4 − Use the Boolean postulate, xx’=0.
⇒ f = 0 + pq + p’q’ + 0
⇒ f = pq + p’q’
Therefore, the complement of Boolean function, p’q + pq’ is pq + p’q’.