Digital Electronics - Boolean

Algebra
Boolean algebra is a branch of mathematics that provides a set of operations
and rules to manipulate and process binary variables. It is considered the
foundation of digital electronics and computer science.

Boolean algebra is based on the binary number system. In this chapter, we will
cover the basic theory of Boolean algebra, its significance, advantages,
limitations, and applications.

What is Boolean Algebra?

Boolean algebra is a mathematics that provides various operators and rules to
perform arithmetic and algebraic operations on binary variables and numbers.
The Boolean algebra is based on the binary number system and logical
arithmetic. Thus, it is also referred to as logical algebra.

Boolean algebra was developed by a mathematician and logician George Boole

in the year of 1847.

Laws of Boolean Algebra

Boolean algebra is a mathematical tool that deals with logical operations and
binary number system. It builds the foundation of digital electronics and
computer science.

The laws and rules in Boolean algebra are the sets of logical statements or
expressions upon which all the logical expressions are built. Each law of the
Boolean algebra can be interpreted as an operation performed by a logic circuit
like a logic gate.

In this chapter, we will learn about laws and rules of Boolean algebra that
are used to simplify the logical functions and Boolean expressions. These laws
and rules are essential tools in Boolean algebra that help to reduce the
complexity and optimize the digital circuits and systems.

Let us learn the primary laws and rules of Boolean algebra in detail that are
used to perform logical operations.

Laws of Boolean Algebra

All the important laws and rules of Boolean algebra are explained below −
 Rules of Logical Operations
There are three basic logical operations namely, AND, OR, and NOT. The
following table highlights the rules associated with these three logical
operations −

AND Operation OR Operation NOT Operation

0 AND 0 = 0 0 OR 0 = 0 NOT of 0 = 1

0 AND 1 = 0 0 OR 1 = 1 NOT of 1 = 0

1 AND 0 = 0 1 OR 0 = 1

1 AND 1 = 1 1 OR 1 = 1

These rules of Boolean algebra can be implemented using logic gates.

AND Laws
In Boolean algebra, there are four AND laws given below −

 Law 1 − A · 0 = 0 (This law is called null law).

 Law 2 − A · 1 = A (This law is called identity law).
 Law 3 − A · A=A
 Law 4 − A · A' = 0

OR Laws
There are four OR laws described below −

 Law 1 − A + 0 = A (This law is called null law).

 Law 2 − A + 1 = 1 (This law is called identity law).
 Law 3 − A + A=A
 Law 4 − A + A' = 1

Complementation Laws
There are following five complementation laws in Boolean algebra −

 Law 1 − 0' = 1
 Law 2 − 1' = 0
 Law 3 − If A = 0, Then A' = 1
 Law 4 − If A = 1, Then A' = 0
 Law 5 − (A')' = A (This is called double complementation law)

Commutative Laws
There are following two commutative laws in Boolean algebra −

Law 1 − According to this law, the operation A OR B produces the same output
as the operation B OR A, i.e.,

A+B=B+A

Hence, the order of the variables does not affect the OR operation.

This law can be extended to any number of variables. For example, for three
variables, it will be,

A+B+C=C+B+A=B+C+A=C+A+B
Law 2 − According to this law, the output of the A AND B operation is same as
that of the B AND A operation, i.e.,

A·B=B·A

This law states that the order in which the variables are ANDed does not affect
the result.

We can extend this law to any number of variables. For example, for three
variables, we get,

A·B·C=A·C·B=C·B·A=C·A·B

Associative Laws
Associative laws define the ways of grouping the variables. There are two
associative laws as described below.

Law 1 − The expression A OR B ORed with C results the same as the A Ored
with B OR C, i.e.,

(A + B) + C = A + (B + C)

This law can be extended to any number of variables. For example, for 4
variables, we get,

(A + B + C) + D = A + (B + C + D) = (A + B) + (C + D)
Law 2 − The expression A AND B ANDed with C results the same as the
expression A ANDed with B AND C, i.e.,

(A · B) · C = A · (B · C)

We can extend this law to any number of variables. For example, if we have 4
variables, then

(ABC)D = A(BCD) = (AB)·(CD)

Distributive Laws
In Boolean algebra, there are the following two distributive laws that allow for
multiplying or factoring out of expressions.

Law 1 − According to this law, we OR several variables and then AND the result
with a single variable.

It gives the same result as the expression in which the single variable is ANDed
with each of the several variables and then ORed the product terms, i.e.,

A · (B + C) = AB + AC

We can extend this law to any number of variables. For example,

A(BC + DE) = ABC + ADE

AB(CD + EF) = ABCD + ABEF

Law 2 − According to this law, if we AND several variables and then the result is
ORed with a single variable.

It gives the same result as we OR the single variable with each of the several
variables and then the sum terms are ANDed together, i.e.,

A + BC = (A + B)(A + C)

Proof − The proof of this law is explained here,

RHS = (A + B)(A + C)

= AA + AB + AC + BC

= A + AB + AC + BC

= A (1 + B + C) + BC
Since,

1+B+C=1+C=1

Therefore,

A · 1 + BC = A + BC = LHS

Redundant Literal Rule (RLR)

Under this rule, there are two laws in Boolean algebra, which are explained
here.

Law 1 − According to this law, if we OR a variable with the AND of the

complement of the variable and another variable. Then, it is same as the OR of
the two variables, i.e.,

A + A’B = A + B

Proof − The proof of this law is explained here,

LHS = A + A’B = (A + A’)(A + B)

= 1 · (A + B) = A + B = RHS

Law 2 − According to this law, if we AND a variable with the OR of the

complement of the variable and another variable, it is equivalent to when we
AND the two variables, i.e.,

A(A’ + B) = AB

Proof − This law can be proved as follows,

LHS = A(A’ + B) = AA’ + AB

= 0 + AB = AB = RHS

Both these laws show that the complement of a term appearing in another term
is redundant. Hence, the rule is named as Redundant Literal Rule.

Idempotence Laws
The term "idempotence" is a synonym for "same value". There are two
idempotence laws in Boolean algebra. They are,
Law 1 − According to this law, ANDing a variable with itself is equal to the
variable, i.e.,

A·A=A

Law 2 − According to this law, ORing a variable with itself is equal to the
variable, i.e.,

A+A=A

Absorption Laws
There are two absorption laws in Boolean algebra and they are explained below.

Law 1 − According to this law, if we OR a variable with the AND of the that
variable and another variable, then it is equal to the variable itself, i.e.,

A+A·B=A

This can be proved as follows,

LHS = A + A · B = A · (1 + B)

= A · 1 = A = RHS

Law 2 − According to this law, the AND of a variable with the OR of that
variable and another variable is equivalent to the variable itself i.e.,

A(A + B) = A

This can also be proved as follows,

LHS = A(A + B) = AA + AB

= A + AB = A(1 + B) = A · 1 = A = RHS

Hence, this law proves that if a term appears in another term, then the latter
term will become redundant and can be removed from the expression.

DeMorgan's Theorem
In Boolean algebra, DeMorgan’s theorem defines two laws which are explained
below.

Law 1 − According to this law, the complement of a sum of variables is

equivalent to the product of complement of each of the variables, i.e.,
 A+B¯¯¯¯¯¯¯¯¯¯¯¯¯=A¯⋅B¯

This law can be extended to any number of variables.

Law 2 − The second law of DeMorgan’s theorem states that the complement of
a product of variables is equivalent to the sum of complement of each of the
variables, i.e.,
AB¯¯¯¯¯¯¯=A¯+B¯

This law can also be extended to any number of variables.

Boolean Functions
In digital electronics, boolean function is a fundamental concept that defines
the logical and mathematical relationship between input binary variables and
binary result. These functions are defined as per the rules of Boolean algebra
and binary number system.

In this chapter, we will explain the fundamentals of Boolean functions, their

properties, advantages, applications. So, let’s get started with a basic
introduction to Boolean function.

What is a Boolean Function?

A Boolean function is a mathematical expression consists of binary variables and

logical operators. It defines a logical relationship between the binary variables
and binary output.

The Boolean functions are defined using the rules of Boolean algebra and binary
number system. These functions build the foundation of design and
development of digital circuits and systems.

Components of a Boolean Function

A Boolean function consists of the following two major components −

 Binary Variables
 Logical Operators

Binary Variables
A binary variable is a symbol that can take one of the two possible values i.e.,
0 and 1. If a binary variable has a value 0 associated to it. Then, it represents a
low or false state. While if the value of the binary variable is 1, then it
represents the high or true state.
Logical Operators
A logical operator is a symbol that represents a logical operation or process. In
Boolean algebra, there are three basic logical operators −
AND Operator
It is denoted by a dot (.). The output of the AND operation is true or high or logic
1, if and only if all its input variables have a value true or high or logic 1. It is a
binary operator, as it requires minimum two input variables.

OR Operator
It is denoted by a plus sign (+). It is also a binary operator, as minimum two
input variables are required. The output of the OR operation is true or high or
logic 1, if any of its inputs is true or high or logic 1.

NOT Operator
The NOT operator is represented by the symbol tilde (~). It is a unary operator
requires only one input variable. The NOT operator inverts or complements the
value of the input variable. Thus, if the value of the input variable is 1, it gives 0
as output and vice versa.

Explore our latest online courses and learn new skills at your own pace. Enroll
and become a certified expert to boost your career.

Representations of Boolean Functions

A Boolean function can be represented in several different forms. The following

are some commonly used representations of Boolean functions −

Mathematical Form
In this form, the Boolean expression is represented as a mathematical
expression consisting of binary variables and logical operators in their symbol
form. For example,

Y(A,B,C) = AB + ABC + BC

This form is also known as algebraic form.

Truth Table
In this form, a Boolean function is represented in a tabular format. The table
represents all the possible combinations of binary variables and their
corresponding binary outputs of the Boolean function.

For example, Y = A + B is a Boolean function and its truth table representation

is shown below.

A B Y

0 0 0

0 1 1

1 0 1

1 1 1

Logic Circuit Diagram

It is the graphical representation of a Boolean function. The logic circuit diagram
represents a Boolean function through an interconnection of logic gates. Where,
each logic gate is represented by using its symbol.

The logic circuit diagram of a Boolean function Y = AB + AC is shown in the

following figure.