EE2202 Introduction to Electronic Engineering

Chapter 7: Boolean Algebra and Reduction Techniques

7.4 Design of Combinational Logic Circuits

The design procedure includes,

 From the specifications of the circuit. determining the required number of inputs and
outputs and assigning a symbol to each
 Deriving the truth table
 Deriving Boolean expression
 Minimizing (Simplify) the Boolean expression if possible
 Implementing using logic elements

Minimization of Boolean expressions

 Algebraic method - Use Boolean algebra

 Karnaugh map or K-map method
 Quine-McCluskey tabular method

Difficulties associated with algebraic method

 Procedures are difficult to apply in a systematic sequence

 Difficult to determine when the minimum solution is achieved.

Karnaugh map (K-map) method

K-map is a diagram made up of squares, with each square representing one minterm of the
function that is to be minimized.

 Graphically shows the output level of a Boolean equation for each of the possible input
variable combinations.
 Each output is placed in a separate cell of the K-map
 K-maps are used to simplify equations having 2,3,4,5 or 6 different input variables
 Normally used for up to 5 input variables
 Number of cells in a K-map is the same as the number of combinations in a Truth Table

2 variable K-map ( 22 = 4 cells) 3 variable K-map ( 23 = 8 cells) 4 variable K-map ( 24 = 16

cells)

1|Page

EE2202 Introduction to Electronic Engineering [2017] Department of Electrical and Information Engineering
When moving from one cell to another only 1 variable changes.
It is important to label the map with the sequence of labeling as shown in Fig. 1

To use K-map reduction,

 Transform the Boolean equation to be reduced to SOP
 Fill in the appropriate cells in the K-map
 Encircle adjacent cells in groups of 2, 4 or 8 (more adjacent cells encircled simpler the final
equation)
 Find each term of the final SOP by determining which variables remain constant within
each circle
Position of miniterms on the K’ map

Prime Implicants (PIs)

A prime implicant is a product term obtained by combining the maximum possible number of
adjustment cells in the K’ map.

IF a minterm in a cell (square) is covered by only one prime implicant that PI is said to be an
Essential Prime Implicant

Examples :

2|Page

EE2202 Introduction to Electronic Engineering [2017] Department of Electrical and Information Engineering