Scribd
Upload
11 views28 pages

4c (Digital System) K-Map Latest

Uploaded by

Syahmi Akmal
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
11 views28 pages

4c (Digital System) K-Map Latest

Uploaded by

Syahmi Akmal
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/ 28

DIGITAL SYSTEM

Chapter 4C: Karnaugh Map (K-Map) and


Combinational Logic Circuit
Learning Outcome
Able to convert between different number systems
Able to understand and use logic gates and Boolean
algebra
Able to minimize Boolean functions using KMap
Able to design and construct combinational logic
circuits
Able to use Medium-scale integration (MSI) devices
Able to design and construct sequential logic circuits
K-Map

• Complex boolean function can be simplified by using


boolean algebra but it lacks specific rules and
becomes tedious sometimes. The map method
provides a simple and straightforward method.
• The Karnaugh Map will simplify logic faster and
more easily in most cases.
 Graphical representation of a truth table
 Can be used to minimize logic functions
 Uses Logic Adjacency
– A.B + A.B' = A (Boolean Algebra Law)
 Group adjacent cells to reduce
– the number of literals in a term
– the number of terms in a Boolean expression
The output from the table is used to fill-in the K-map.
1’s are used to create a Sum of Product (SOP) solution.
(min terms)
0’s are used to create a Product of Sum (POS) solution.
(max terms)
2 variable map 3 variable map 4 variable map

• Note the sequence of numbers across the top of the map. It is not in
binary sequence which would be 00, 01, 10, 11. It is 00, 01, 11, 10
which is Gray code sequence.
Karnaugh Maps - Rules of Simplification
The K-Map uses the following rules for simplification
of expressions by grouping together adjascent cells
containing ones.

1. Groups may not include any cell containing a


zero
2. Groups may be horizontal or vertical, but not diagonal.

3. Groups must contain 1, 2, 4, 8, or in general 2 n cells.


That is if n = 1, a group will contain two 1's since 2 1 = 2.
If n = 2, a group will contain four 1's since 2 2 = 4.
4. Each group should be as large as possible.

5. Each cell containing a one must be in at least one group.


6. Groups may overlap.

7. Groups may wrap around the table. The leftmost cell in a row may be
grouped with the rightmost cell and the top cell in a column may be
grouped with the bottom cell.
8. There should be as few groups as possible, as long as this does not
contradict any of the previous rules.
3 variable map

Mapping the four product terms (p-terms)


yields a single group of four, which is A’.
Mapping the four p-terms above yields a group of four. Visualize
the group of four by rolling up the ends of the map to form a
cylinder, then the cells are adjacent. We normally mark the group
of four as above left. Out of the variables A, B, C, there is a
common variable: C'. C' is a 0 over all four cells. Final result is C'
Larger 4-variable Karnaugh maps

The above Boolean expression has seven


product terms. The dashed horizontal group
corresponds the the simplified product term
AB. The vertical group corresponds to
Boolean CD. Since there are two groups,
there will be two product terms in the Sum-
Of-Products result of Out=AB+CD.
The four cells above are a group of four because B=0 for
the four cells, and D=0 for the four cells. Thus, these
variables (A, B) are not involved with this group of four.
This single group comes out of the map as one product
term for the simplified result: Out=B'D'.
The above group of eight has one Boolean variable in common:
B=0. Therefore, the one group of eight is covered by one p-term:
B'. The original eight term Boolean expression simplifies to
Out=B'
Boolean function obtained from a k-map may not be
unique.
Often times there is more than one minimum cost solution to a
simplification problem. Such is the case illustrated below.
Both results above have four product terms of three Boolean
variable each. Both are equally valid minimal cost solutions.
The difference in the final solution is due to how the cells are
grouped as shown above. A minimal cost solution is a valid
logic design with the minimum number of gates with the
minimum number of inputs.
Example
Example
Example
What is the resulting minimum SOP expression?
Example: POS
Exercise

You might also like