BOOLEAN ALGEBRA

DEFINITION
 Introduction: Boolean Algebra

Boolean Algebra is a branch of algebra in which

the values of the variables are truth values
True/False usually denoted by 1/0.

The variables can take only two values

therefore, termed as Boolean Algebra and as its
main application is in designing logic circuits
so also known as Logical Algebra.
 Axioms of Boolean Algebra

The sets of logical expressions are known as

Axioms or postulates of Boolean Algebra.

An axiom is nothing more than the definition of

three basic logic operations (AND, OR, and NOT).
+ denotes the Logical OR operation
. denotes the Logical AND operation
! denotes the Logical NOT operation
Logic Gate Examples of Boolean
Algebra
Truth Table Examples of Boolean
Algebra
Truth Table Examples of Boolean
Algebra
 Laws/ Theorems of Boolean Algebra
 Commutative Law
 Associative Law
 Distributive Law
 Annulment Law
 Identity Law
 De-Morgan’s Law
 Idempotent Law
 Complement Law
 Double Negation Law
 Absorption Law
 1. Commutative Law
Any binary operation which satisfies the following expression is
referred to as commutative operation. [ Order of variable does
not matter]

A.B=B.A
The order in which two variables are AND’ed makes
no
difference.

A+B=B+A
The order in which two variables are OR’ed makes
no
difference.

Commutative law states that changing the sequence of the

variables does not have any effect on the output of a logic
 2. Associative Law
This law states that the order in which the logic operations are
performed is irrelevant as their effect is the same. [ Order of
operation performed does not matter]

A + (B + C) = (A + B) + C
OR Association Law

A.(B.C) = (A.B).C
AND Association Law
 3. Distributive Law
Distributive law states the following condition

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

AND Distribution Law

A + (B.C) = (A + B).(A + C)
OR Distribution Law
 4. Annulment Law
A term AND´ed with a “0” equals 0
A term OR´ed with a “1” will equal 1

A . 0 = 0  A∩ ∅ = ∅
A variable AND’ed with 0 is always
equal to 0

A + 1 = 1 𝑨 𝖴 𝑼 = 𝑼
A variable OR’ed with 1 is always equal to 1
 5. Identity Law
A term OR´ed with a “0” or AND´ed with a “1” will equal to that
term.

A+0=A
A variable OR’ed with 0 is always equal to the variable

A .1 = A
A variable AND’ed with 1 is always equal to the variable
 6. Idempotent Law
An input that is AND´ed or OR´ed with itself is equal to that
input .

A+A=A
A variable OR’ed with itself is always equal to the variable

A .A = A
A variable AND’ed with itself is always equal to the variable
 7. Complement Law
A term AND´ed with its complement is equals “0”
A term OR´ed with its complement is equals “1”

A.𝑨 =0
A variable AND’ed with itself complement is always equal to 0

A + 𝑨 =1
A variable OR’ed with itself complement is always equal to 1
 8. Double Negation Law or Involution Law
A term inverted twice is equal to the original term

𝑨 =A
A double complement of a variable is always equal to the
variable
 9. Absorption Law
This law enables a reduction in a complicated expression to a
simpler one by absorbing like terms.

𝑨 + (𝑨. 𝑩) = 𝑨
𝑨 𝖴𝑨 ∩ 𝑩 = 𝑨
OR Absorption Law

𝑨 . (𝑨 + 𝑩) = 𝑨
𝑨 ∩𝑨 𝖴 𝑩 = 𝑨
AND Absorption Law
 10. De-Morgan’s Law
This law enables a reduction in a complicated expression to a
simpler one by absorbing like terms.

𝑨+𝑩= 𝑨. 𝑩

𝑨. 𝑩 = 𝑨+𝑩
Simplification/ Algebraic Manipulation of Boolean Expressions

Example 1
MINTERM &
MAXTERM
CNF & DNF
Disjunctive Normal Form
(DNF)
A Boolean expression is said to be in DNF, also
known as minterm canonical form , if the
expression is a Sum of Minterms (SOP).

𝑪 = 𝒂𝒃𝒄 ∨ 𝒂𝒃𝒄′ ∨ 𝒂𝒃′𝒄′

𝑪 = 𝒂𝒃𝒄 + 𝒂𝒃𝒄′ + 𝒂𝒃′𝒄′

Or
Minter
Suppose we are dealing with 𝒏 Boolean variables.
m
A minterm is any product of 𝒏 literals where each
of the 𝒏 variables appears once in the product.

Example: 𝒏 = 𝟑 and variables are a, b and c

• Then, abc, ab’c, ab’c’ , a’b’c’ are all minterms.

• ab is not a minterm because c is missing.
• Also, abca’ is not a minterm because a appears
multiple times as a and a’.
Minter
m
Method to create DNF
(SOP)
𝒇.
1. Create truth table of the given Boolean Function

2. For each row where the value is 1,

create a minterm as follows:
 For a combination 111, the minterm is abc.
 For combination of 010, the
minterm is a’bc’.

3. The DNF of 𝒇 is the sum of all minterms

created in step 2.
Example 1: DNF
For the function 𝒇 𝒙, 𝒚, 𝒛
(SOP) = 𝒙𝒚 ′ 𝒛 ′ +
𝒚 ′ 𝒛 ′ + 𝒙𝒛′
x y z f
1 1 1 0
1 1 0 1 xyz’
1 0 1 1 xy’z
1 0 0 1 xy’z’
0 1 1 0
0 1 0 0
0 0 1 1 xyz’
0 0 0 0

The minterms of 𝒇(where 𝒇 is 𝟏) are: 𝒙𝒚𝒛′ , 𝒙𝒚′ 𝒛, 𝒙𝒚

′ 𝒛′ , 𝒙′ 𝒚′ 𝒛.
Conjunctive Normal Form
(CNF)
A Boolean expression is said to be in CNF, also
known as maxterm canonical form , if the
expression is a Product of Maxterms (POS).

𝒇 𝒂, 𝒃, 𝒄 = (𝒂 + 𝒃 + 𝒄) 𝖠 (𝒂 + 𝒃 + 𝒄′) 𝖠 (𝒂 + 𝒃′
+ 𝒄′)

𝒇 𝒂, 𝒃, 𝒄 = 𝒂+𝒃+𝒄 . 𝒂+𝒃+
or

𝒄′ . (𝒂 + 𝒃′ + 𝒄′)
Maxter
m
Suppose we are dealing with 𝒏 Boolean variables.

A maxterm is any sum of 𝒏 literals where each of

the 𝒏
variables appears once in the sum.

Example: 𝒏 = 𝟑 and variables are a, b and c

• Then, a+b+c, a+b’+c, a+b’+c’ , a’+b’+c’ are all maxterms.

• a+b is not a maxterm because c is missing.
Minter
m
Method to create CNF
Create truth table of the given Boolean Function 𝒇.
(POS)
1.

2. Add a column 𝒇′ to the right of the column 𝒇 and

fill it with the complement of 𝒇 (if 𝒇 = 𝟏 𝐭𝐡𝐞𝐧 𝒇’
= 𝟎 and if 𝒇 = 𝟎 then 𝒇’ = 𝟏).

3. Create the DNF of 𝒇′applying Step2 and 3 of DNF.

4. Apply De-Morgan’s law on the DNF of 𝒇′, we get CNF

of 𝒇.
Example 2: CNF
For the function 𝒇 𝒙, 𝒚, 𝒛
(POS) = 𝒙𝒚 ′ 𝒛 ′ +
𝒚 ′ 𝒛 ′ + 𝒙𝒛′ x y z f f’
1 1 1 0 1 xyz
1 1 0 1 0
1 0 1 1 0
1 0 0 1 0
0 1 1 0 1x’yz
0 1 0 0 1x’yz’
0 0 1 1 0
0 0 0 0 1x’y’z’

DNF of 𝒇 ′ = 𝒙𝒚𝒛 + 𝒙 ′ 𝒚𝒛 + 𝒙 ′ 𝒚𝒛 ′ + 𝒙
′ y’z’ CNF of 𝒇= (𝒇’)’ = (x’+y’+z’)(x+y’+z’)(x+y’+z)
Example 4: CNF
For the function 𝒇 𝒙, 𝒚, 𝒛
(POS) = 𝒙𝒚 ′ 𝒛 ′ + 𝒙
′ 𝒚 ′ 𝒛 + 𝒙 ′ 𝒚𝒛 ′
x y z f
1 1 1 0 (x’+y’+z’)
1 1 0 0 (x’+y’+z)
1 0 1 0 (x’+y+z’)
1 0 0 1 xy’z’
0 1 1 0 (x+y’+z’)
0 1 0 1 x’yz’
0 0 1 1 x’y’z
0 0 0 0 (x+y+z)

of 𝒇
DNF (1’s) (minterms)= xy’z’+x’yz’+x’y’z

CNF of 𝒇
(0’s) (maxterms)= (x’+y’+z’) (x’+y’+z) (x’+y+z’) (x+y’+z’) (x+y+z)
Example 4: CNF
For the function 𝒇 𝒙, 𝒚, 𝒛
(POS) = 𝒙𝒚 ′ 𝒛 ′ + 𝒙
′ 𝒚 ′ 𝒛 + 𝒙 ′ 𝒚𝒛 ′
x y z f
1 1 1 0 (x’+y’+z’)
1 1 0 0 (x’+y’+z)
1 0 1 0 (x’+y+z’)
1 0 0 1 xy’z’
0 1 1 0 (x+y’+z’)
0 1 0 1 x’yz’
0 0 1 1 x’y’z
0 0 0 0 (x+y+z)

of 𝒇
DNF (1’s) (minterms)= xy’z’+x’yz’+x’y’z

CNF of 𝒇
(0’s) (maxterms)= (x’+y’+z’) (x’+y’+z) (x’+y+z’) (x+y’+z’) (x+y+z)
KARNAUGH-MAP
(K-MAP)
Karnaugh Map (K-
Map)
1. In many digital circuits and practical problems we
need to find expression with minimum variables.

2. We can minimize Boolean expressions of 3, 4 variables

very easily using K-map without using any Boolean
algebra theorems.

3. K-map can take two forms Sum of Product (SOP) and

Product of Sum (POS) according to the need of
problem.

4. K-map is table like representation but it gives more

information than TRUTH TABLE. We fill grid of K-map
with 0’s and 1’s then solve it by making groups.
Steps to solve K-
Map
1. Select K-map according to the number of variables.

2. Identify min terms or max terms as given in problem.

3. For SOP put 1’s in blocks of K-map respective to the min

terms (0’s elsewhere).

4. For POS put 0’s in blocks of K-map respective to the max

terms(1’s elsewhere).

5. Make rectangular groups containing total terms in power of

two like 2,4,8 ..(except 1) and try to cover as many elements
as you can in one group.

6. From the groups made in step 5 find the product terms and
sum them up for SOP form.
SUM OF PRODUCTS
(SOP)
Steps to solve K-
Map

Red = A’C
Green =AB
Output= A’C+AB
Steps to solve K-
Map
Steps to solve K-
Map

1 1

Red = QS
Green = Q’S’
Output= QS +Q’S’
PRODUCTS OF SUM
(POS)
Steps to solve K-Map: POS
Form

Brown =A +B + C
Red = A’+B’
Green = B’+C’
Output= (A+B+C)(A’+B’)(B’+C’)
Steps to solve K-
Map

Note: – 1. Always remember POS ≠ (SOP)’

2. The correct form is (POS of F)=(SOP of F’)’
Steps to solve K-
Map

Brown =A’ + C’+ D

Red = A’+B’+C
0
Green = A+B’+D’
Blue= A+B+C’
Output=
(A’+C’+D)(A’+B’+C)(A+B’+D’)(A+B+C’)
SOP & POS WITH
DON’T CARE
Significance of "Don't Care"
Conditions:
1. Simplification: These conditions denote the set of inputs that never occurs for
given digital circuits. Therefore, to simplify the boolean output expressions, the
'don't care' are used.

2. Reduced Power Consumption: The switching of the state is reduced when we

group the terms long with "don't care". This reduces the required memory
space resulting in lower power consumption.

3. Lesser number of gates: For reducing the number of gates that are used to
implement the given expression, simplification places an important role. So,
the 'don't care' makes the logic design more economical.

4. Prevention of Hazards: In the digital system, the 'don't care' place an important
role in hazards prevention.

5. States in Code Converters: These also play an important role in code

conversion. For example- In the design of a 4-bit BCD-to-XS-3 code converter,
the input combinations 1010, 1011, 1100, 1101, 1110, and 1111 are don't
cares.
Minimize SOP with Don’t
Care
Minimize f = m(1,5,6,12,13,14) + d(4) in SOP minimal form

f = BC' + BD' + A'C'D

Minimize SOP with Don’t
Care
SOP minimal form using K-Maps: F(A, B, C, D) = m(1, 2, 6,
7, 8, 13, 14, 15) + d(3, 5, 12)

f = AC'D' + A'D + A'C + AB

Minimize SOP with Don’t
Care
SOP minimal form using K-Maps: F(A, B, C, D) = m(1, 2, 6,
7, 8, 13, 14, 15) + d(3, 5, 12)

f = AC'D' + A'D + A'C + AB

Minimize POS with Don’t
POS minimal form using K-Maps: F(A,B,C,D) = M(6,7,8,9) +
Care
d(10,11,12,13,14,15)

F= A’ . (B' + C')
Minimize POS with Don’t
POS minimal form using K-Maps: F(A,B,C,D) = M(6,7,8,9) +
Care
d(10,11,12,13,14,15)

F= A’ . (B' + C')
Combinational/ Sequential Circuits
Combinational circuits are defined as the time independent circuits which do not
depends upon previous inputs to generate any output are termed as combinational
circuits.
Sequential circuits are those which are dependent on clock cycles and depends on
present as well as past inputs to generate any output.
THANK YOU
!