CLO
Chapter 2
BOOLEAN ALGEBRA
Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It
uses only the binary numbers i.e. 0 and 1. It is also called as Binary
Algebra or logical Algebra. Boolean algebra was invented by George Boole
in
1854.
Rule in Boolean
Algebra
Following are the important rules used in Boolean algebra.
Variable used can have only two values. Binary 1 for HIGH and Binary 0
for LOW.
Complement of a variable is represented by an overbar (-). Thus,
complement of variable B is represented as . Thus if B = 0 then =1
and B = 1 then = 0.
ORing of the variables is represented by a plus (+) sign between them.
For example ORing of A, B, C is represented as A + B + C.
Logical ANDing of the two or more variable is represented by writing a dot
between them such as A.B.C. Sometime the dot may be omitted like ABC.
Boolean
Laws
There are six types of Boolean Laws.
Commutative
law
Any binary operation which satisfies the following expression is referred to as
commutative operation.
Commutative law states that changing the sequence of the variables does not
have any effect on the output of a logic circuit.
Associative
law
This law states that the order in which the logic operations are performed is
irrelevant as their effect is the same.
3
CLO
Distributive law
Distributive law states the following condition.
AND law
These laws use the AND operation. Therefore they are called as AND laws.
OR law
These laws use the OR operation. Therefore they are called as 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.
Important Boolean Theorems
Following are few important boolean theorems.
Boolean Description
function/theorems
Boolean Functions Boolean Functions and Expressions, K-Map and
NAND Gates realization
De Morgan's Theorems De Morgan's Theorem 1 and Theorem 2
3
CLO
12. BOOLEAN
FUNCTION
Boolean algebra deals with binary variables and logic operation. A Boolean
Function is described by an algebraic expression called Boolean expression
which consists of binary variables, the constants 0 and 1, and the logic operation
symbols. Consider the following example.
Here the left side of the equation represents the output Y. So we can state
equation no. 1
Truth Table Formation
A truth table represents a table having all combinations of inputs and their
corresponding result.
It is possible to convert the switching equation into a truth table. For example,
consider the following switching equation.
The output will be high (1) if A = 1 or BC = 1 or both are 1. The truth table for
this equation is shown in Table (a). The number of rows in the truth table is
2n where n is the number of input variables (n=3 for the given equation). Hence
there are 23 = 8 possible input combination of inputs.
3
CLO
Methods to Simplify a Boolean
Function
The methods used for simplifying a Boolean function are as follows:
Karnaugh-map or K-map, and
NAND gate method.
Karnaugh-map or K-
map
The Boolean theorems and the De-Morgan's theorems are useful in manipulating
the logic expression. We can realize the logical expression using gates. The
number of logic gates required for the realization of a logical expression should
be reduced to a minimum possible value by K-map method. This method can be
done in two different ways, as discussed below.
Sum of Products (SOP)
Form
It is in the form of sum of three terms AB, AC, BC with each individual term is a
product of two variables. Say A.B or A.C etc. Therefore such expressions are
known as expression in SOP form. The sum and products in SOP form are not
the actual additions or multiplications. In fact they are the OR and AND
functions. In SOP form, 0 represents a bar and 1 represents an unbar. SOP form is
represented by .
Given below is an example of SOP.
3
CLO
Product of Sums (POS)
Form
It is in the form of product of three terms (A+B), (B+C), or (A+C) with each
term is in the form of a sum of two variables. Such expressions are said to be in
the product of sums (POS) form. In POS form, 0 represents an unbar and 1
represents a bar. POS form is represented by .
Given below is an example of POS.
NAND Gates
Realization
NAND gates can be used to simplify Boolean functions as shown in the example
below.
4
CLO
4
CLO
13. DE MORGAN'S
THEOREMS
De Morgan has suggested two theorems which are extremely useful in Boolean
Algebra. The two theorems are discussed below.
Theorem 1
The left hand side (LHS) of this theorem represents a NAND gate with
inputs A and B, whereas the right hand side (RHS) of the theorem
represents an OR gate with inverted inputs.
This OR gate is called as Bubbled OR.
Table showing verification of the De Morgan's first theorem:
4
CLO
Theorem 2
The LHS of this theorem represents a NOR gate with inputs A and B,
whereas the RHS represents an AND gate with inverted inputs.
This AND gate is called as Bubbled AND.
Table showing verification of the De Morgan's second theorem:
4
CLO
14. LOGIC GATES
Logic gates are the basic building blocks of any digital system. It is an electronic
circuit having one or more than one input and only one output. The relationship
between the input and the output is based on a certain logic. Based on this,
logic gates are named as AND gate, OR gate, NOT gate etc.
AND
Gate
A circuit which performs an AND operation is shown in figure. It has n input (n
>= 2) and one output.
Logic diagram
Truth Table
OR
Gate
A circuit which performs an OR operation is shown in figure. It has n input (n >=
2) and one output.
4
CLO
Logic diagram
Truth Table
NOT Gate
NOT gate is also known as Inverter. It has one input A and one output Y.
Logic diagram
Truth Table
NAND Gate
A NOT-AND operation is known as NAND operation. It has n input (n >= 2) and
one output.
4
CLO
Logic diagram
Truth Table
NOR Gate
A NOT-OR operation is known as NOR operation. It has n input (n >= 2) and one
output.
Logic diagram
Truth Table
4
CLO
XOR
Gate
XOR or Ex-OR gate is a special type of gate. It can be used in the half adder, full
adder and subtractor. The exclusive-OR gate is abbreviated as EX-OR gate or
sometime as X-OR gate. It has n input (n >= 2) and one output.
Logic diagram
Truth Table
XNOR
Gate
XNOR gate is a special type of gate. It can be used in the half adder, full adder
and subtractor. The exclusive-NOR gate is abbreviated as EX-NOR gate or
sometime as X-NOR gate. It has n input (n >= 2) and one output.
Logic diagram
4
CLO
Truth Table
4
CLO
4
CLO
