Scribd
Upload
16 views18 pages

CH 5

Uploaded by

sifbdd
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
16 views18 pages

CH 5

Uploaded by

sifbdd
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/ 18

Digital Logic Circuit

(디지털 논리회로)
Lecture 5: Karnaugh Maps
Interview

SungHoon Lim
Department of Electrical Engineering
Jeonbuk National University
Minimum Forms

Minimum Sum-of-Products (최소 논리곱의 합)


✓ Minimum number of terms
✓ Minimum number of literals
→ Use the following operation: XY ’ + XY = X
→ This procedure may depend on the order in which terms are combined

2
Minimum Forms

Minimum Product-of-Sums (최소 논리합의 곱)


✓ Minimum number of factors
✓ Minimum number of literals
→ Use the following operation: (X + Y )(X +Y’ ) = X
→

3
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ Karnaugh map: Specifies the function for every combination of values
of the independent variables

Given truth table

4
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ Three variables – Karnaugh map
✓ Minterms in adjacent squares of the map differ by only one variable
and can be combined using the theorem (XY ’ + XY = X )
✓ Example: 011 is adjacent to 001, 010, and 111
✓ Top and bottom rows of the map are also adjacent

5
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ If the minterm expansion of a function is given, the map
can be plotted by placing 1’s to corresponding minterms
✓ For a product term, Karnaugh maps can be plotted as
below

a = 1, c = 0

b=1

6
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ The map for the complement of F is formed by replacing 0’s with 1’s
and 1’s with 0’s on the map of F
✓ The terms in the top row combine to form b'c', and the terms in the
bottom row combine to form bc’
✓ Because b’c’ and bc’ differ in only one variable, the top and bottom
rows can then be combined to form a group of four 1’s

Complement

7
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ XY+X’Z+YZ = XY+X’Z : YZ is a consensus term
✓ Since the term YZ is covered by the other two terms, it can be eliminated

8
Karnaugh Maps

Two- and Three-Variable Karnaugh Maps


✓ If a function has two or more minimum sum-of-products forms, all of
these forms can be determined from a map.

Two solutions for m(0,1,2,5,6,7)

9
Karnaugh Maps

Four-Variable Karnaugh Maps


✓ In addition to the top and bottom rows being adjacent, as in the three-
variable map, the first and last columns are also adjacent
✓ Minterms 0 and 8, 1 and 9, etc., are in adjacent squares

10
Karnaugh Maps

Four-Variable Karnaugh Maps


✓ Example

✓ Frist term (acd) is 1 when a=c=d=1


→ Place 1’s in the two squares which are in the a = 1 column and cd =
11 row
✓ Second term (a’b) is 1 when ab = 01
→ Place four 1’s in the ab = 01 column
✓ Third term (d’) is 1 when d = 0
→ Place eight 1’s in the two rows for which d = 0

11
Karnaugh Maps

Four-Variable Karnaugh Maps


✓ Simplification: After plotting the maps, minterms can be combined in
groups of two, four, or eight
✓ In (a), the pair of 1’s in the ab=00 column and the d=1 rows represents
a’b’d.
✓ The group of four 1’s in the b=1 columns and c=0 rows represents bc’

12
Karnaugh Maps

Determination of Minimum Expressions Using Essential Prime Implicants


✓ A sum-of-products expression that includes a term which is not a
prime implicant cannot be minimum
✓ In order to find the minimum sum of products from a map, we must
find a minimum number of prime implicants which cover all of the 1’s
on the map
✓ Six prime implicants in the below figure
✓ Shaded loops represent prime implicants which are not part of the
minimum solution
✓ note that there are often prime implicants which are not included in
the minimum sum of products

13
Karnaugh Maps

Determination of Minimum Expressions Using Essential Prime Implicants


✓ Because all of the prime implicants of a function are generally not
needed in forming the minimum sum of products, a systematic
procedure is required
✓ If CD is chosen first, then BD, B’C, and AC are needed to cover the
remaining 1’s → Four terms
✓ CD is not needed as shown in (b) for minimum solution

14
Karnaugh Maps

Determination of Minimum Expressions Using Essential Prime Implicants


✓ Essential prime implicant: If a minterm is covered by only one prime
implicant
→ Figure (a): B’C is an essential prime implicant because m2 is not
covered by any other prime implicant
→ Figure (a): CD is not essential because each of the 1’s in CD can be
covered by another prime implicant

15
Karnaugh Maps

Determination of Minimum Expressions Using Essential Prime Implicants


✓ Start with 14, adjacents (X0, 15, 16) are not
covered by a single term → No essential prime
implicant
✓ Next with 16, adjacent (14 and X7) are covered
by A’B → A’B is essential prime implicant
✓ Next with 113,adjacent (15, 19, X15) are not
covered by a single term → No essential prime
implicant

16
Karnaugh Maps

Five-Variable Karnaugh Maps


✓ Five-variable Karnaugh map can be constructed in three dimensions
by placing one four-variable map on top of a second one

17
Karnaugh Maps

Use of Karnaugh Maps


✓ Karnaugh map can be used as a guide in determining what steps to
take

18

You might also like