Boolean algebra

Boolean algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers
that is 0 and 1. It is also referred to as Binary Algebra or Logic Algebra.

Boolean algebra is the mathematics we use to analyse digital gates and circuits. We can use these “Laws
of Boolean” to both reduce and simplify a complex Boolean expression in an attempt to reduce the
number of logic gates required. Boolean algebra is therefore a system of mathematics based on logic
that has its own set of rules or laws which are used to define and reduce Boolean expressions.

Basic Boolean operations

AND, OR, NOT and Secondary operations NAND, NOR, EX-OR, EX-NOR; their algebraic functions and
truth tables

Boolean operations are well expressed as logic gates.

i) The logic gates are the main structural part of a digital system.

ii) Logic Gates are a block of hardware that produces signals of binary 1 or 0 when input logic
requirements are satisfied.

iii) Each gate has a distinct graphic symbol, and its operation can be described by means of algebraic
expressions.

iv) The seven basic logic gates include: primary operations (AND, OR, NOT), secondary operations (XOR,
NAND, NOR, and XNOR).

v) The relationship between the input-output binary variables for each gate can be represented in
tabular form by a truth table.

vi) Each gate has one or two binary input variables designated by A and B and one binary output variable
designated by x.

AND: The AND gate is an electronic circuit which gives a high output only if all its inputs are high. The
AND operation is represented by a dot (.) sign.
OR: The OR gate is an electronic circuit which gives a high output if one or more of its inputs are high.
The operation performed by an OR gate is represented by a plus (+) sign.

NOT: The NOT gate is an electronic circuit which produces an inverted version of the input at its output.
It is also known as an Inverter.

NAND: The NOT-AND (NAND) gate which is equal to an AND gate followed by a NOT gate. The NAND
gate gives a high output if any of the inputs are low. The NAND gate is represented by a AND gate with a
small circle on the output. The small circle represents inversion.
NOR: The NOT-OR (NOR) gate which is equal to an OR gate followed by a NOT gate. The NOR gate gives
a low output if any of the inputs are high. The NOR gate is represented by an OR gate with a small circle
on the output. The small circle represents inversion.

XOR: The 'Exclusive-OR' gate is a circuit which will give a high output if one of its inputs is high but not
both of them. The XOR operation is represented by an encircled plus sign.
XNOR: The 'Exclusive-NOR' gate is a circuit that does the inverse operation to the XOR gate. It will give a
low output if one of its inputs is high but not both of them. The small circle represents inversion.

Using Karnaugh Maps

A Karnaugh map provides a pictorial method of grouping together expressions with common factors and
therefore eliminating unwanted variables. The Karnaugh map can also be described as a special
arrangement of a truth table.

The diagram below illustrates the correspondence between the Karnaugh map and the truth table for
the general case of a two variable problem.

The Karnaugh map

Boolean Laws, Theorems and Expressions

Table 1: Boolean Laws, Theorems and Expressions

Laws and Theorems Statements Expressions

AND law These laws use the AND

operation. Therefore they are
called AND laws

OR law These laws use the OR

operation. Therefore they are
called OR laws

Inversion law This law uses the NOT

operation. The inversion law
states that double inversion
of a variable results in the
original variable itself

Commutative law Any binary operation which (a) A + B = B + A

satisfies the following
expression is referred to as (b) A B = B A
commutative operation
Associative law This law states that the order (a) (A + B) + C = A + (B + C)
in which the logic operations
are performed is irrelevant as (b) (A B) C = A (B C)
their effect is the same

Distributive law This law permits the (a) A (B + C) = A B + A C

multiplying or factoring out
of an expression (b) A + (B C) = (A + B) (A + C)

De-Morgan’s Theorems There are two “de Morgan´s” (a)

rules or theorems,
(b)

(1) Two separate terms NOR

´ed together is the same as
the two terms inverted
(Complement) and AND´ed

for example:

(2) Two separate terms NAND

´ed together is the same as
the two terms inverted
(Complement) and OR´ed for
example:

Simplification (Reduction) Rules for Boolean expressions

Let us consider an example of a Boolean function: AB+A (B+C) + B (B+C)

The logic diagram for the Boolean function AB+A (B+C) + B (B+C) can be represented as:

Sample logic diagram 1

We will simplify this Boolean function on the basis of rules given by Boolean algebra.

AB + A (B+C) + B (B+C)

AB + AB + AC + BB + BC {Distributive law; A (B+C) = AB+AC, B (B+C) = BB+BC}

AB + AB + AC + B + BC {Idempotent law; BB = B}

AB + AC + B + BC {Idempotent law; AB+AB = AB}

AB + AC +B {Absorption law; B+BC = B}

B + AC {Absorption law; AB+B = B}

Hence, the simplified Boolean function will be B + AC.

The logic diagram for Boolean function B + AC can be represented as:

Sample logic diagram 2

Conclusion:
At the end of this learning outcome, the learner should be able to explain Boolean algebra, basic
Boolean operations, secondary operations, illustrate Boolean expressions, simplify Boolean expressions,
illustrate Boolean laws and theorems and illustrate simplification rules for Boolean expressions.

Further Reading

Wolfram, S. A New Kind of Science. Champaign, IL: Wolfram Media, p. 1168, 2002

http://www.ee.surrey.ac.uk/Projects/Labview/minimisation/karnaugh.html