Is the term 'Sum of min-terms' same as 'Standard SOP form' in Boolean Algebra?

884 Views Asked by At

I want to ask that if we are told to express an Boolean Expression in sum of min-terms which is already in non-standard SOP form. So do we need to express it in Standard SOP form or what?

For Example:

Express the following Boolean Function in sum of min-terms$$ F=ABC+BC+ACD$$

My Question:

Do we need to solve it like below?

$F=ABC+BC+ACD$

$F=ABC(D+D')+(A+A')BC(D+D')+A(B+B')CD$

$F=ABCD+ABCD'+ABCD+A'BCD+ABCD'+A'BCD'+ABCD+AB'CD$

Now using the OR Gate's Law, we would minimize it a little bit

$F=ABCD+ABCD'+A'BCD+A'BCD'+AB'CD$

Is this how we need to solve it? Or do we need to do it the other way, writing the Boolean Function in it's Binary Form and then convert those Binary numbers into decimals to get the min-terms and simply write them in Sigma notation to show sum of min-terms, like it has done in the following example?

enter image description here