In: Electrical Engineering
Could you please solve these problems and explain the steps?
Consider a 3-input function G whose POS form is known to contain
the maxterm X + Y + Z.
1) What is the maximum number of minterms that the SOP form of G
can have such that no simplification is possible? Derive the
corresponding Boolean expression for both SOP form and POS form.
Can G0 be simplified?
2) Let us assume that all minterms that do not exist in the SOP
form of G are “don’t care”s. Can the POS form of F be simplified? If
so, what is the simplified Boolean expression for F?