Scribd
Upload
11 views16 pages

Ec 5

Uploaded by

Akash Maurya
Copyright
© © All Rights Reserved
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
11 views16 pages

Ec 5

Uploaded by

Akash Maurya
Copyright
© © All Rights Reserved
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/ 16

Today:

• Gate-level minimization – part 2


– Four variable K-maps
– POS implementation using K-maps
– Incompletely specified functions & Don’t care
– Ex-OR being an “Odd function”
– Application: Parity generator & checker
Four variable K-map
Remarks
Example
Given:

Solution:
Example
Given:

Solution:
Remarks
• Ensure following while choosing adjacent
squares in a K-map:
1. All the minterms of the function are covered
when we combine the squares.
2. The number of terms in the expression is
minimized.
3. There are no redundant terms, i.e., minterms
already covered by other terms.
Note: Sometimes there may be two or more
expressions that satisfy the simplification criteria.
A more systematic way to combine the squares

• Prime implicant is a product term obtained by


combining the maximum possible number of
adjacent squares in the K-map.

• If a minterm in a square is covered by only one


prime implicant, that prime implicant is said to
be essential.
Example
…continued

Four possible ways to express the


corresponding function:
Product-of-Sums (POS)
Implementation using K-map
• Hint:
Use DeMorgan’s property in the K-map and
we can obtained the POS implementation
instead of the SOP form.
Find POS implementation See that it is
SOP equation
Find the SOP and POS
implementations for given Truth-table
K-map representation

SOP expression POS expression


Incompletely specified functions
• Functions that have unspecified outputs for
some input combinations are called
incompletely specified functions.

meaning of unspecified:
e.g., in a design for an application, some
combinations of the inputs are not used and
hence considered as unspecified.
Don’t care conditions
• The unspecified minterms of a function called as
don’t-care conditions.
meaning:
we simply don’t care what value is assumed by
such minterms, either 0 or 1.

• Symbol in the K-map: “X”

• Use in simplifying the Boolean functions.


Ex: function with don’t-care conditions
with

You might also like