MODULE-UNIT-3-karnuagh-mapping (1)
MODULE-UNIT-3-karnuagh-mapping (1)
Hans Hofmann emphasized, "The ability to simplify means to eliminate the unnecessary so that the
necessary may speak."
LEARNING OBJECTIVES
By the time the you finish the lesson, you are expected to:
This lesson is all about complements (Radix and Diminished radix) which are used
by digital systems to simplify subtraction. The complements are also used in
converting signed numbers into binary.
The Karnaugh map method provides a simple, straightforward procedure for minimizing
Boolean expressions. The K-map minimization procedure obtains a minimal expression
directly from a truth table. The map is a diagram made up of squares containing 1s
and/or 0s. The map presents a visual diagram of all possible ways a function may be
expressed in a standard form. By recognizing various patterns, the user can derive
alternative algebraic expression for the same function.
1. Construct a K-map.
3. Translate each group into a product term by eliminating any variable whose value
changes from cell to cell.
Note: Don't care conditions can be used to provide further simplification of the
representation of a function.
y y
x x
0 1 0 1
0 m0 m1 0 x’y’ x’y
1 m2 m3 1 xy’ xy
From the Karnaugh map there are four minterms for two variables. The 0’s and 1’s
designate the values of variable x and y, respectively. Variable x appears primed in row
0 and unprimed in row 1. Similarly, y appears primed in column 0 and unprimed in
column 1.
A three-variable map
yz yz
00 01 11 10 00 01 11 10
x x
There are 8 minterms for three binary variables (8 squares). The minterms are not
arranged in a binary sequence; however, it is listed similar to Gray code. Variables
appear unprimed in the squares where it is equal to 1 and primed where it is equal to 0.
Any 2 adjacent squares in the map differ by only one variable, which is primed in one
square and unprimed in the other. From the map above, m5 and m7 lie in two adjacent
squares where y is primed in m5 and unprimed in m7.
bc
F = a’b + ab ’= a b
There are cases where two cases are considered to be adjacent even though they don’t
touch each other. You simplify the Boolean function F (x, y, z) = Σ (3, 4, 6,7)
The number of adjacent squares that may be combined must always represent a
number that is a power of two such as 1, 2, 4, and 8. As a larger number of adjacent
squares are combined, you obtain a product term with fewer literals.
1. One square represents one minterm, giving a term of three literals.
2. Two adjacent squares represent a term of two literals.
3. Four adjacent squares represent a term of one literal.
4. Eight adjacent squares encompass the entire map and produce a function that
is equal to 1.
F = b’ + a’c
AB
F = C + A’B
F (A, B, C) = ∑ (1, 2, 3, 5, 7)
1.2 SAMPLE PROBLEMS WITH SOLUTION
X X
F = x’ + y F = z + xy
A A
A A
BC BC
A A
F = A’C + B F = A’B’ + AC
9. F(A, B, C, D, E) = ∑ (1, 3, 9, 12, 13, 14, 15, 16, 17, 18, 19, 20, 28, 29, 30, 31)
F = A’ + B’ + C + D
1.3 DON’T CARE CONDITIONS
o Can be used to simplify functions
o It is presented by the symbol ‘x’ X can be treated as
logic 0 or 1.
a. F (x, y, z) = ∑ (0,1,4)
d (x, y, z) = ∑ (2,6,7)
YZ
X F = z’ + x’y’
b. F (A, B, C, D) = ∑ (0,1,4,5,9)
d (10,13,14,15)
CD
AB
F = A’C’ + C’D
SUMS OF MINTERM
Example:
a. F = ABC + ABC’ + A’B’C’ + ABC’
b. F = A’BCD’ + ABCD + A’B’CD + A’B’C’D’
PRODUCTS OF MAXTERM
SUM OF PRODUCTS
o Product term/s may/not contain all input variables.
Example:
a. F = (x+y’) (x+z’)
b. F = (B+B) (C+D’) (A+C+D’)
YZ
SOP = xy + z
X POS = (x + z) (y + z)
AB
The basic building blocks of digital circuits are logic gates. There are eight basic logic
gates.
1. BUFFER 2. INVERTER
NAND and NOR gates are generally faster and use fewer components than AND or OR
gates. • Any logic function can be implemented using only NAND gates or only NOR
gates. Î NAND gate or NOR gate forms a functionally complete set since any switching
function can be expressed in terms of NAND gate or NOR gate.
NAND IMPLEMENTATION
NOR IMPLEMENTATION
GATHER AND APPLY INTEGRATED KNOWLEDGE AND SKILLS
Now that you learned about the types of complements, form a group with a
maximum of five(5) members then solve the following questions applying your
new knowledge and skills. Discuss your output in the class.
1.
a.) F = A + B
b.) F = A’ + B
c.) F = B’ + A’
d.) F = B’ + A
2.
a.) F = A’B
b.) F = B’C + A’
c.) F = AC
d.) F = A’ + B
3.
a.) F = A’BC’
b.) F = BC’
c.) F = B + C’
d.) F = A’B + BC’
5.
a.) F = AC’
b.) F = AB + AB’
c.) F = B’C’
d.) F = A + C’
6.
a.) F = C’ + A’B + BC
b.) F = A’ + B’C + AB
c.) F = ABC’ + B’C + A’B’
d.) F = A’B’C + BC’ + AB
7.
8.
9.
F = AD’ + AB’C’ + A’B’CD’
F = A’B’C’D’ + A’B’CD’ + A’B
F = AB’ + A’B’ + C
F = B’D’ + AB’
10 – 15. Using K-map simplify the Boolean functions with don’t care condition.
10.
a.) F = C’D’ + AB
b.) F = BC’ + AB
c.) F = BC’D’ + AD’
d.) F = AB’ + AB
11.
a.) F = C’D’ + B’D
b.) F = A’B’ + C’D + A’D
c.) F = C’D + A’D
d.) F = B’ + CD’ + A’D + A’B’
12.
14.
15.
F = A’B + BC’ + BD F =
A’B + A’CD’ + BC’D’
F = A’B + BD + ABD
F = A’D’ + A’B + BD + ABD
16 – 18. Convert the Boolean functions to SOP & POS.
16.
a.) SOP: F = ACD + B’ POS: F = (A’+D’) (B’+D’)
b.) SOP: F = A’C’D’ + B POS: F = (A+D) (B+D)
c.) SOP: F = AD + BD POS: F = (A’+C’+D’) (B)
d.) SOP: F = A’D’ + B’D’ POS: F = (A+C+D) (B’)
17.
18.
a.) SOP: F = A’B’ + D’ POS: F = (A’+D’) (B’+D’)
b.) SOP: F = A’D’ + B’D' POS: F = (A’+B’) (D’)
c.) SOP: F = AD +BD POS: F = (A+B) (D)
d.) SOP: F = AB + D POS: F = (A+D) (B+D)
19 – 20. Simplify the Boolean functions using a five-variable K-map.
19.
20.
a.) D + C’
b.) D’ + C
c.) D
d.) D’