0% found this document useful (0 votes)
8 views3 pages

K-map Boolean Simplification Tutorial

Uploaded by

r19764464
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
0% found this document useful (0 votes)
8 views3 pages

K-map Boolean Simplification Tutorial

Uploaded by

r19764464
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

Tutorial 3 - Digital Systems

1. Simplify the Boolean expressions using 3-variable K-maps.

ˆ (a) F (x, y, z) = (3, 4, 6, 7)

ˆ (b) F (x, y, z) = (0, 2, 4, 5, 6, 7)

ˆ (c) F (x, y, z) = (1, 3, 5, 7, 6)

2. Simplify the following Boolean function using a Karnaugh map (K-map) and identify
the prime implicants and essential prime implicants:

X
Y = (0, 2, 3, 4, 9, 10, 12, 13) + d(6, 8, 14)

3. A logic circuit realizes the function F(a,b,c,d) = a’b’ + a’cd + ac’d + ab’d’. Assuming
that a = c never occurs when b = d = 1, find a simplified expression for F.

4. Consider the Boolean function z(a, b, c) in Figure 1. Which of the following minterm
expansions represents this circuit ?

(a) z = Σ(0, 1, 3, 7)

(b) z = Σ(1, 4, 5, 6, 7)

(c) z = Σ(2, 4, 5, 6, 7)

(d) z = Σ(2, 3, 5)

Figure 1: Logic Circuit

5. A plot of minterms for a four variable function is given in Figure 2. Draw the K-map
and simplify.

1
Figure 2: Plot of minterms of a function of four variables

6. A logic circuit realizing a function f has four inputs a, b, c and d. The three inputs a,
b, and c are the binary representations of the digits 0 through 7 with a being the most
significant bit. The input d is an odd-parity bit; that is, the value of d is such that a, b,
c, and d always contain an odd number of 1s. (For example, the digit 1 is represented by
abc = 001 and d = 0, and the digit 3 is represented by abcd = 0111.) The function f has
value 1 if the input digit is a prime number. Cells which correspond to an even number
of 1s (including 0000) represent don’t cares. Draw a Karnaugh map for f and simplify to
get the minimum sum of products for f.

7. The plot of minterms for a four-variable Boolean function is given in Figure 3. Find
the minimal POS form using a K-map of the function.

Figure 3: Plot of minterms for a four-variable function

8. For F (a, b, c, d) = π(0, 1, 3, 7), the number of terms in the minimal SOP form is given
by ’X’. Find the value of X. Explain your solution.

9. Draw a logic diagram using only two-input NOR gates to implement the following:

F (A, B, C, D) = (A ⊕ B)′ (C ⊕ D)

2
10. What is the output of the circuit shown below?

You might also like