Scribd
Upload
76 views8 pages

Lect08-2optimized 2

This document discusses minimizing logic functions using prime implicants and don't care conditions. It defines terms like literal, implicant, prime implicant, and cover. It explains how to find essential and nonessential prime implicants on a Karnaugh map and use them to find minimum sum-of-products and product-of-sums expressions. Examples are provided to demonstrate minimizing completely and incompletely specified functions using don't cares. Guidelines are given for determining minimum logic expressions from K-maps with don't cares.

Uploaded by

purwant10168
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views8 pages

Lect08-2optimized 2

This document discusses minimizing logic functions using prime implicants and don't care conditions. It defines terms like literal, implicant, prime implicant, and cover. It explains how to find essential and nonessential prime implicants on a Karnaugh map and use them to find minimum sum-of-products and product-of-sums expressions. Examples are provided to demonstrate minimizing completely and incompletely specified functions using don't cares. Guidelines are given for determining minimum logic expressions from K-maps with don't cares.

Uploaded by

purwant10168
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

ECE380 Digital Logic

Optimized Implementation of
Logic Functions:
Strategy for Minimization,
Minimum Product-of-Sums Forms,
Incompletely Specified Functions
Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-1

Terminology
• For a given term, each appearance of a variable (in
true or complemented form) is called a literal
– xyz’ => three literals
– abc’d => four literals
• Any ‘1’ or group of ‘1’s that can be combined on a K-
map represents an implicant of a function
• An implicant is a prime implicant if it cannot be
combined with another implicant to remove a
variable
• A collection of implicants that account of all
valuations for which a given function is ‘1’ is called a
cover of that function
• Cost is the number of gates plus the total number of
inputs to all gates in the circuit
Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-2

1
Terminology example
ab
cd 00 01 11 10 f(a,b,c,d)=Σm(0,1,4,5,7,9,11)
00 1 1 0 0
01 1 1 0 1 Example Implicants: all single ‘1’s,
a’c’, a’b’c’,
11 0 1 0 1 a’bd, ab’d
10 0 0 0 0
Prime Implicants: a’c’, a’bd, ab’d, b’c’d

f(a,b,c,d)min: a’c’+a’bd+ab’d

Thus, a minimum SOP form contains only


(but not necessarily all) prime implicants.

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-3

Prime implicants distinctions


• Essential: needed to form a minimum
solution
• Nonessential: not necessarily needed to
form a minimum solution
ab
cd 00 01 11 10 All prime implicants: b’d, a’bc’, abc
a’c’d, acd
00 0 1 0 0
Essential primes: b’d, a’bc’, abc
01 1 1 0 1
Nonessential primes: a’c’d, acd
11 1 0 1 1
f(a,b,c,d)min: b’d+a’bc’+abc
10 0 0 1 0

Minimum contains all essential and possibly some nonessential primes


Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-4

2
Prime implicants example

ab
cd 00 01 11 10 Essential primes: a’c, ac’d
00 0 0 0 0
Nonessential primes: a’bd, bc’d
01 0 1 1 1

11 1 1 0 0 One of these must be


included to form a
10 1 1 0 0 minimum solution

a’bd
f(a,b,c,d)min: a’c+ac’d+
bc’d

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-5

Prime implicants example


Identify all prime implicants for the
given truth table. Which are essential
and which are nonessential? What is
a minimum SOP expression for this
function?

ab
cd 00 01 11 10
00 0 0 0 0
01 0 1 1 1

11 0 1 1 0
10 1 1 0 1

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-6

3
Minimization of POS expressions
• POS minimization using K-maps proceeds
exactly as does SOP form except that
groupings of ‘0’s in the K-map are used to
form POS terms.
• K-map can be constructed directly from ΠM
expression for a function
• Place ‘0’s in the K-map for every maxterm in
the ΠM expression

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-7

Minimization of POS example

f(a,b,c)=(a+b’+c’)(a’+b+c’)(a’+b’+c)(a’+b’+c’)

f(a,b,c)=ΠM(3,5,6,7)

ab
c 00 01 11 10
0 1 1 0 1
1 1 0 0 0

f=(a’+b’)(b’+c’)(a’+c’)

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-8

4
Minimization of POS example

f(a,b,c,d)=ΠM(0,1,4,8,10-12,14,15)

ab
cd 00 01 11 10 (c+d)
(a+b+c) 00 0 0 0 0
01 0 1 1 1

11 1 1 0 0 (a’+c’)
10 1 1 0 0

f(a,b,c,d)min= (a+b+c)(a’+c’)(c+d)

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-9

K-map groupings example


• Draw the K-map and give the minimized POS
logic expression for the following.
– f(a,b,c)=ΠM(0,2,3,5-7)
• Show the groupings made in the K-map

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-10

5
Incompletely specified functions
• In digital systems it often happens that some
input conditions (i.e. some input valuations)
can never happen
• An input combination that can never happen
is referred to as a don’t care condition
• As a circuit is designed, a don’t care
condition can be ignored (i.e. the output for
that condition can be treated as 0 or 1 in the
truth table)
• A function that has don’t care condition(s) is
said to be incompletely specified

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-11

Example function with don’t


cares
Assume for a three variable function f(x,y,z)
that the input combination xy=01 never occurs,
x y z f otherwise the function is Σm(0,1,4,5)
0 0 0 1
0 0 1 1
0 1 0 d f(x,y,z)= Σm(0,1,4,5)+D(2,3)
0 1 1 d
Or
1 0 0 1
1 0 1 1 f(x,y,z)= ΠM(6,7) · D(2,3)
1 1 0 0
1 1 1 0

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-12

6
Example function with don’t
cares

f(x,y,z)= Σm(0,1,4,5)+D(2,3) f(x,y,z)= ΠM(6,7) · D(2,3)

xy xy
z 00 01 11 10 z 00 01 11 10
0 1 d 0 1 0 1 d 0 1
1 1 d 0 1 1 1 d 0 1

f(x,y,z)= y’ f(x,y,z)= y’

Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-13

Minimum SOP form


1. Choose a minterm (a ‘1’ in the K-map) which is not
yet covered (don’t consider d’s).
2. Find all adjacent ‘1’s and ‘d’s (check the n adjacent
cells for an n-variable K-map).
3. If a single term (i.e. a single looping) covers the ‘1’
and all adjacent ‘1’s and ‘d’s then the looping forms
an essential prime implicant. Loop the essential
prime.
4. Repeat steps 1-3 until all essential prime implicants
are located.
5. Find a minimum set of nonessential prime
implicants to cover (loop) the remaining ‘1’s. If
more than 1 set is possible, choose the set with the
minimum number of literals (the largest grouping).
Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-14

7
Minimum POS form
1. Choose a maxterm (a ‘0’ in the K-map) which is not
yet covered (don’t consider d’s).
2. Find all adjacent ‘0’s and ‘d’s (check the n adjacent
cells for an n-variable K-map).
3. If a single term (i.e. a single looping) covers the ‘0’
and all adjacent ‘0’s and ‘d’s then the looping forms
an essential prime implicant. Loop the essential
prime.
4. Repeat steps 1-3 until all essential prime implicants
are located.
5. Find a minimum set of nonessential prime
implicants to cover (loop) the remaining ‘0’s. If
more than 1 set is possible, choose the set with the
minimum number of literals (the largest grouping).
Electrical & Computer Engineering Dr. D. J. Jackson Lecture 8-15

You might also like