Scribd
Upload
9 views9 pages

Simplifying Boolean Functions

The document contains a series of problems focused on simplifying Boolean functions into minimum sum of products and minimum product of sums. It includes multiple problems with varying numbers of variables and specific minterms to simplify. Additionally, it addresses implementation of functions using different gate circuits.

Uploaded by

aarthur0224
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
9 views9 pages

Simplifying Boolean Functions

The document contains a series of problems focused on simplifying Boolean functions into minimum sum of products and minimum product of sums. It includes multiple problems with varying numbers of variables and specific minterms to simplify. Additionally, it addresses implementation of functions using different gate circuits.

Uploaded by

aarthur0224
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

Problem 3.

2
Simplify the following Boolean functions to
minimum sum of products and minimum
product of sums:
(a) F(x,y,z) = (2,3,4,5,7)
(b) F(x,y,z) = (0,1,4,5,6,7)
(c) F(x,y,z) = (0,1,2,4,5,6)
(d) F(x,y,z) = (1,2,3,5,6,7)
Problem 3.5
Simplify the following Boolean functions to
minimum sum of products and minimum
product of sums :
(a) F(w,x,y,z) = (0,2,3,4,6,8,9,12)
(b) F(A,B,C,D) = (0,1,2,3,5,8,13)
Problem 3.6
Simplify the following Boolean functions to
minimum sum of products and minimum
product of sums :
(a) ABC’D’ + AB’C + B’C’D’ + AB’CD + B’C’D
(b) w’x’y’ + w’x’yz + x’y’z + xyz + y’z’
Problem 3.7
Simplify the following Boolean functions to
minimum sum of products and minimum
product of sums :
(a) w’x’z + xy’ + w’x + wxy
(b) A’BD’ + BCD + ABC’ + BD + ABC
Problem
Simplify the following Boolean function, using
five-variable maps:

F(A,B,C,D,E) = (0,1,4,5,16,17,21,25,29)
Problem 3.15
Simplify the following Boolean function to
minimum sum-of-products form and
minimum product-of-sums form:

(c) F(A,B,C,D) = m(3,5,6,11) + d(4,7,9,12,15)


(d) F(A,B,C,D) = m(4,5,8,9,14,15) +
d(2,3,12,13)
Problem 3.16
Simplify the following function, and implement it
with two-level NAND gate circuits:

b) F(A,B,C,D) = A’CD’ + A’BD +ABD + AB’CD


c) F(A,B,C,D) = (A’ + B’ + C)(A’ + B’ + C’)(B’ + C’ + D)
Problem 3.19
Simplify the following function, and implement
it with two-level NOR gate circuits:

(a) F(w,x,y,z) = wx’y’ + wy’z’ + xy’


(b) F(w,x,y,z) = m(0,2,8,9,10,11,14)
Problem 3.24
Implement the following Boolean function,
using the two-level forms of logic (a) AND-OR,
(b) OR-NAND, (c) NOR-OR, (d) NAND-NAND,
(e) OR-AND, (f) NOR-NOR, and (g) NAND-AND:

F(A,B,C,D) = (0,4,8,9,10,11,12,14)

You might also like