Scribd
Upload
25 views24 pages

DLD Lecture 05

Basic to Digital and Logic Design Theory

Uploaded by

Asmad Shoaib
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views24 pages

DLD Lecture 05

Basic to Digital and Logic Design Theory

Uploaded by

Asmad Shoaib
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

DIGITAL LOGIC DESIGN

Lecture 05: Gate Level Minimization- The Karnaugh Map Method

UNIVERSITY OF HARIPUR
INTRODUCTION – THE K-MAP METHOD

 A Karnaugh map or a K-map refers to a pictorial method that is utilised to minimise various
Boolean expressions without using the Boolean algebra theorems along with the equation
manipulations
 The K map can also be described as a special arrangement of a truth table.
THE K-MAP METHOD
CHOICE OF BLOCKS

 Do we really need all blocks?


Need to define new terms
 –Implicant
 –Prime implicant
 –Essential prime implicant
 Non-Essential prime implicant
TERMINOLOGY
IMPLICANT

 A single one or group of one’s (power of 2) which are adjacent can be combined in the
K-map known as Implicants
PRIME IMPLICANT

 The largest group of one's which can be combined to form a group is known as Prime
Implicant.
PRIME IMPLICANT
ESSENTIAL PRIME IMPLICANT

 A prime implicant with at least one element that is not covered by one or more prime
implicants
ESSENTIAL PRIME IMPLICANT
NON ESSENTIAL OR REDUNDANT PRIME IMPLICANT

 Prime implicant that has no element that cannot be covered by other prime implicant
NON ESSENTIAL OR REDUNDANT PRIME IMPLICANT
PROCEDURE FOR FINDING THE MINIMAL FUNCTION VIA K-
MAPS

 Convert truth table to K-map


 Include all essential primes
 Include non essential primes as needed to completely cover the onset (all cells of value
one)
2 VARIABLE MAP EXAMPLE 1
2 VARIABLE MAP EXAMPLE 2
2 VARIABLE K-MAP EXAMPLE 3

 F= x1’x2’+x1’x2+x1x2
3-VARIABLE K MAP
3-VARIABLE K MAP EXAMPLE 1
3-VARIABLE K MAP EXAMPLE 2
3-VARIABLE K MAP EXAMPLE 3
3-VARIABLE K MAP EXAMPLE 4
3-VARIABLE K MAP EXAMPLE 5
3-VARIABLE K MAP EXAMPLE 6
SELF TASKS

You might also like