Module ②

Make use of Boolean algebra and the

Karnaugh Map for the implementation of
logic functions.

1
Boolean algebra

Boolean algebra is a mathematical system for the

manipulation of variables (x,y,z,a,b..) that can have one of
two values:-
• In formal logic, these values are “true” and “false.” George Boole
• In digital systems, these values are
-“on” and “off,”
- 1 and 0,
- “high” and “low.”
Boolean algebra

Boolean expressions are created by performing operations on Boolean variables.

Common Boolean operators include AND, OR, and NOT.
A Boolean operator can be completely described using a truth table.
The truth table for the Boolean operators NOT, AND and OR are shown below.

The AND operator is also known as a Boolean product.

The OR operator is the Boolean sum.
The NOT operation is inverse and most often designated by an overbar.
Boolean algebra

A two-valued Boolean algebra is defined on a set of 2 elements x = {0,1}

with 3 binary operators OR (+), AND ( • ), and NOT ( ' ).

The truth table for the Boolean function:

is shown below.
Boolean Algebra Laws
We can use Boolean identities to simplify the function:
Simplify the expressions:
Simplify the expressions:
Boolean expression can be classified as:
1. Sum of Products ( SOP)
2. Product of sums (POS)

Sum of Products (SOP)

A type of Boolean expression where several product terms are summed

together.

Example:
Z= AB+BC+ACD
F=ABC+AC+D

Products OF sums (POS)

A type of Boolean expression where several sum terms are multiplied

together.

Example:
Z= (A+B) (B+C)(A+C)
F=(A+B+C)(A+C+D)
Convert the given expression into canonical form

f= x + xy + xyz

X Y Z XY XYZ F
0 0 0 0 0 0
0 0 1 0 0 0
0 1 0 0 0 0
0 1 1 0 0 0
1 0 0 0 0 1
1 0 1 0 0 1
This is the required minterm.
1 1 0 1 0 1 By adding these terms to get canonical SOP form
1 1 1 1 1 1
Convert the canonical POS equation of the given expression
Y= A+AB+ABC

A B C AB ABC Y
0 0 0 0 0 0
0 0 1 0 0 0 This is the required maxterm.
0 1 0 0 0 0 Product of these terms to get canonical POS form

0 1 1 0 0 0
1 0 0 0 0 1
1 0 1 0 0 1
1 1 0 1 0 1
1 1 1 1 1 1
Define minterm. Expand A’+B’ to minterms.
Logic Gates

A gate is an electronic device that produces a

result based on two or more input values.

 Boolean functions are implemented in digital

computer circuits called gates.
 In reality, gates consist of one or more transistors.
 Integrated circuits ( IC ) contain collections of gates
suited to a particular purpose. Eg: 7400 IC contains 4
no’s of two input NAND gates
Logic Gates

There are 7 gates

1. OR
2. AND BASIC GATES

3. NOT
4. NOR
UNIVERSAL GATES
5. NAND
6. XOR
7. XNOR

The 3 BASIC GATES are OR, AND and NOT gates.

The 2 UNIVERSAL GATES are NOR and NAND.

1. OR GATE
Logic Symbol Logic Expression Truth Table

2. AND GATE
Logic Symbol Logic Expression Truth Table

3. NOT GATE
Logic Symbol Logic Expression Truth Table

18
4. NOR GATE
Logic Symbol Logic Expression Truth Table

5. NAND GATE
Logic Symbol Logic Expression Truth Table

19
6. XOR GATE
Logic Symbol Logic Expression Truth Table

7. XNOR GATE
Logic Symbol Logic Expression Truth Table

20
• NAND and NOR
are known as
universal gates
because any NOT GATE USING NAND GATES
Boolean function
can be
constructed using
only NAND or only
NOR gates. AND GATE USING NAND GATES

• Also they are

inexpensive to
manufacture.

OR GATE USING NAND GATES

21
Gates can have multiple inputs and more than one output. A
second output can be provided for the complement of the
operation.

23
• The main thing to remember is that combinations of
gates implement Boolean functions.
• The circuit below implements the Boolean function:

We simplify our Boolean expressions so that we can create simpler circuits.

24
Karnaugh Map
A graphical tool for finding the SOP or POS simplification of a
Boolean function. The variables can be cancelled by grouping
minterms or maxterms.

Cell: The smallest unit of a Karnaugh map.

Pair: A group of 2 adjacent cells in a Karnaugh map.
Quad: A group of 4 adjacent cells in a Karnaugh map.

25
Three variable K-Map
Four variable K- Map
27
Rules followed for K-Map Simplification
1. Groups do not include any cell containing zero

2. Groups may be horizontal or vertical but not diagonal

28
Wrong Right
29
4. Each group should be as large as possible

5. A pair eliminates one variable

6. A quad eliminates two variables from the simplified logic function.
7. A octate eliminates three variables.
8. Overlapping allowed.

30
Examples of Grouping of Cells
1. Karnaugh
Grouping of Map
2 adjacent 1’s ( pair)

31
2. Grouping of 4 adjacent 1’s ( quad)
3. Grouping of 8 adjacent 1’s ( octet)
Karnaugh Map

39
Karnaugh Map

40
Karnaugh Map

41
Karnaugh Map

42
Karnaugh Map

43
Karnaugh Map

44
Don’t Care

• The “Don’t Care” conditions allow us to replace the empty cell of a K-Map to form
a grouping of the variables which is larger than that of forming groups without
don’t care.

• While forming groups of cells, we can consider a “Don’t Care” cell as 1 or 0 or we

can also ignore that cell. Therefore, the “Don’t Care” condition can help us to form
a larger group of cells.

• A Don’t Care cell can be represented by a cross(X) representing an invalid

combination.

45
Example-1:
Minimise the following function in SOP minimal form using K-
Maps:
f = m(1, 5, 6, 11, 12, 13, 14) + d(4)

Therefore, SOP minimal is,

f = BC' + BCD' + A'C'D + AB'CD

46
Minimise the following function in POS minimal form using K-Maps:
F(A, B, C, D) = m(0, 1, 2, 3, 4, 5) + d(10, 11, 12, 13, 14, 15)

• Writing the given expression in POS form:

• F(A, B, C, D) = M(6, 7, 8, 9) + d(12, 13, 14, 15)

Therefore, POS minimal

is,
F = (A'+ C)(B' + C')

47
Minimise the following function in SOP minimal form using K-Maps:
F(A, B, C, D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(0, 3, 5, 12)

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

48