Minimize the following expression in (a) Sum of Products and (b) Product of Sums forms:
(A’ + B’ + D)(A’ + D’)(A + B + D’)(A + B’ + C + D)
It is already in the POS form.
(A’ + B’ + D)(A’ + D’) (A + B + D’)(A + B’ + C + D)
= (A' + A'D' + A'B' + A'D) (A + AB' + AC + AD + AB + BC + BD + AD'
+ B'D' + CD')
= A'(1 + D' + B' + D) (A(1 + B' + C + D + B + D') + BC + BD + B'D'
+ CD')
= A' (A + BC + BD + B'D' + CD')
= A'BC + A'BD + A'B'D' + A'CD'
(which is the reqd. SOP form)
Minimize the following expression in (a) Sum of Products and (b) Product of Sums forms: (A’...
Find a minimal sum-of-products and product-of-sums expression for the function: f(A, B, C, D) = sigma m(1, 2, 3,5,13) + d (6,7,8,9,11)
For each of the following, describe the circuit in Sum-of-products and Productof-sums forms. Include a truth table and show all of your work. Note: here + means OR, * means AND, and ~ means NOT. Exercise 1. ( ~A + (C + B) ) * ( ~( ~B * ~C ) ) Exercise 2. ~( ~A * B ) * ~( ~A * ~B ) + A * C
2. Find the minimum sum of products and the minimum product of sums for the following function fla, b, c, d) Il M(0, 1, 6, 8, 11, 12). Il D(3, 7, 14, 15)
2.22" Convert each of the following expressions into sum of products and product of sums: (a) (AB +C)(B + C'D) (b) x +x(x y)(+z')
Using K-maps, obtain the simplified product-of-sums and
sum-of-products expressions for the following Boolean
functions:
a).
b).
F(x, y,2)-(3,5,6,7) d(0, 1,2) F(w,x, y, z) (0,1,2,3,7,8, 10)+ d(5,6,11, 15)
Convert this Boolean function from a sum-of-products form to a simplified product-of-sums form: F(a,b,c,d) = ∑(0,1,2,5,8,10,13)
Minimize the function in sum-of-product form and Minimize the complement of the function in Sum-of-product form. f(A,B,C) = A'B'C'+A'BC+AB'C+ABC'+ABC
6a. Given 3 inputs A, B and C define a boolean expression that is true when 2 or 3 inputs are TRUE using minterms and sum of products. b. Use a Kmap to minimize the expression from 6A. c. Draw out the Digital Logic Diagram for the expression from 6B.
Given the following truth table, build the following circuits using: SUM OF PRODUCTS PRODUCT OF SUMS Show both equation. Turn in the circuit (.circ) file(s). Use the labels from the Truth Table. Name of circuit file(s): ________________________ Inputs Output C B A Y 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1
5. Minimize the following Boolean functions into sum-of-products form using a K-map (b) F(a,b,c,d) = P(0,2,3,4,6,8,14,15) Letter P mean the Sum (d) F(a,b,c,d) = Q(3,4,5,6,7,9,11,12,13,14) Letter Q mean Pi