Scribd
Upload
79 views2 pages

Tut 4

This document provides examples for using Karnaugh maps to minimize logic functions with 4 variables or less. It includes exercises to find minimum sum of products and product of sums expressions, derive truth tables, and draw logic diagrams using NAND and NOR gates. Students are asked to plot functions on Karnaugh maps, find essential prime implicants, minimize logic expressions, and design logic circuits from Boolean functions.

Uploaded by

Harshil Patel
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
79 views2 pages

Tut 4

This document provides examples for using Karnaugh maps to minimize logic functions with 4 variables or less. It includes exercises to find minimum sum of products and product of sums expressions, derive truth tables, and draw logic diagrams using NAND and NOR gates. Students are asked to plot functions on Karnaugh maps, find essential prime implicants, minimize logic expressions, and design logic circuits from Boolean functions.

Uploaded by

Harshil Patel
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/ 2

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI - K. K.

BIRLA GOA CAMPUS


DIGITAL DESIGN Tutorial 4

Ex 1: Find the minimum sum of products for each function using a Karnaugh map.

1. f1 (a, b, c) = m0 + m2 + m5 + m6

2. f2 (r, s, t) = rt’ + r’s’ + r’s

3. f3 (x, y, z) = M0 · M5

Ex 2:

1. Plot the following function on a Karnaugh map. (Do not expand to minterm form before
plotting.)
F(A, B,C, D) = BD0 + B0CD + ABC + ABC0 D + B0 D0

2. Find the minimum sum of products.

3. Find the minimum product of sums.

Ex 3: A switching circuit has two control inputs (C1 and C2 ), two data inputs (X1 and X2 ), and one
output (Z). The circuit performs one of the logic operations AND, OR, EQU (equivalence), or XOR
(exclusive OR) on the two data inputs. The function performed depends on the control inputs:

Function performed
C1 C2
by circuit

0 0 OR

0 1 XOR

1 0 AND

1 1 EQU

1. Derive a truth table for Z.

2. Use a Karnaugh map to find a minimum AND-OR gate circuit to realize Z.

Ex 4: Find the minimum sum-of-products expression for each function. Underline the essential
prime implicants in your answer and tell which minterm makes each one essential.

1. f (a, b, c, d) = ∑ m(0, 1, 3, 5, 6, 7, 11, 12, 14)

2. f (a, b, c, d) = ∏ M(1, 9, 11, 12, 14)


Digital Design (CS F215/ECE F215/EEE F215/INSTR F215) Page 2 of 2

3. f (a, b, c, d) = ∏ M(5, 7, 13, 14, 15) · ∏ D(1, 2, 3, 9)

Ex 5: Find the minimum sum-of-products expression for each function.

1. f (a, b, c, d) = ∑ m(0, 2, 3, 4, 7, 8, 14)

2. f (a, b, c, d) = ∑ m(1, 2, 4, 15) + ∑ d(0, 3, 14)

3. f (a, b, c, d) = ∏ M(1, 2, 3, 4, 9, 15)

4. f (a, b, c, d) = ∏ M(0, 2, 4, 6, 8) · ∏ D(1, 12, 9, 15)

Ex 6: Find the minimum sum of products and the minimum product of sums for each function:

1. f (a, b, c, d) = ∏ M(0, 1, 6, 8, 11, 12) · ∏ D(3, 7, 14, 15)

2. f (a, b, c, d) = ∑ m(1, 3, 4, 11) + ∑ d(2, 7, 8, 12, 14, 15)

Ex 7: Given F = AB’D’ + A’B + A’C + CD.

1. Use a Karnaugh map to find the maxterm expression for F (express your answer in both
decimal and algebric notation).

2. Use a Karnaugh map to find the minimum sum-of-products form for F’.

3. Find the minimum product of sums for F.

Ex 8: Draw a NAND logic diagram that implements the complement of the following function:
F(A, B,C, D) = ∑(0, 1, 2, 3, 6, 10, 11, 14)
Ex 9: Draw a logic diagram using only two-input NOR gates to implement the following function:
F(A, B,C, D) = (A ⊕ B)0 (C ⊕ D)

You might also like