布尔函数_布尔函数的POS和SOP形式表示

布尔函数

There are four ways in which a Boolean function can be expressed which are as follows,

布尔函数可以通过四种方式表示，如下所示：

1. Product of Sum (POS) Form

   总和(POS)表格的乘积

2. Sum of Product (SOP) Form

   产品总和(SOP)表格

3. Canonical Form of POS/SOP Form

   POS / SOP表格的规范形式

1)总和(POS)表格的乘积 (1) Product of Sum (POS) Form)

As the name suggests, A POS expression contains the sum of various terms ANDed/multiplied together.

顾名思义， POS表达式包含与/相乘/相乘在一起的各种项的总和 。

Example: Y = (A + B). (C + D). (E + F)

2)产品总和(SOP)表格 (2) Sum of Product (SOP) Form)

As the name suggests, A SOP expression is a group of product terms ORed/added together.

顾名思义， SOP表达式是一组产品术语ORed /加在一起 。

Example: Y = (A. B) + (C. D) + (E. F)

3)POS / SOP表格的规范形式 (3) Canonical Form of POS/SOP Form)

If each term of SOP/POS expression contains all the literals in the Boolean function, then they are said to be in canonical form. Suppose, we have a Boolean function (Y) having three literals A, B and C, then canonical Boolean expressions can be written as,

如果SOP / POS表达式的每个术语都包含布尔函数中的所有文字，则称它们为规范形式 。 假设我们有一个包含三个文字A，B和C的布尔函数(Y)，则可以将标准布尔表达式写为：

Y = ABC + A. B. C + A.B.C

This is an example of canonical SOP Form, because each term in the SOP form contains all the literals A, B and C.

这是规范SOP形式的示例，因为SOP形式中的每个术语都包含所有文字A ， B和C。

Similarly, Y = (A+B+C). (A + B + C). (A+B+C)

This is an example of canonical POS form, because each term of the POS form contains all the literals.

这是规范POS形式的示例，因为POS形式的每个术语都包含所有文字。

Now, let's see a few problems on canonical form.

现在，让我们看看规范形式上的一些问题。

Example 1: Convert the following expressions in their canonical form.

示例1：将以下表达式转换为规范形式。

1. Y (A, B, C) = AB + BC + CA

   Y(A，B，C)= AB + BC + CA

2. Y (X, Y, Z) = X. (X + Y). (X + Y + Z)

   Y(X，Y，Z)=X。(X + Y)。 (X + Y + Z )

Solution (i):

解决方案(i)：

Y (A, B, C) = AB + BC + CA, this expression is a SOP expression, since we notice the Boolean function has three literals A, B and C, so each term of the Boolean expression must contain all the three literals to convert it into canonical SOP form. Therefore,

Y(A，B，C)= AB + BC + CA ，此表达式是一个SOP表达式 ，因为我们注意到布尔函数具有三个文字A ， B和C ，所以布尔表达式的每个项都必须包含所有三个文字将其转换为规范的SOP形式。 因此，

= Y (A, B, C) = AB + BC + CA
= AB. (C + C) + BC. (A + A) + CA. (B + B)	[Since, C + C = 1]
= ABC + AB. C + ABC + A. BC + ABC + A. B. C
= ABC + AB. C + A. BC + A. B. C
Hence, 
Y = ABC + AB. C + A. BC + A. B.C 
is the required canonical SOP form representation.

Solution (ii):

解决方案(ii)：

Y (X, Y, Z) = X. (X + Y). (X + Y + Z), is an example of POS expression, since all the sum terms in the expression doesn't have all the literals X, Y and Z, so we have to express it in such a way that it will have all the three literals in each term.

Y(X，Y，Z)=X。(X + Y)。 (X + Y + Z )是POS表达式的一个例子，因为表达式中的所有和项都不具有全部的文字X ， Y和Z ，所以我们必须用这样的方式来表达它：每个术语中的所有三个文字。

= Y (X, Y, Z) = X. (X + Y). (X + Y + Z)
= (X + Y. Y + Z. Z) (X + Y + Z. Z). (X + Y + Z)
= (X + Y. Y + Z) (X + Y. Y + Z) (X + Y + Z) (X + Y + Z) (X + Y + Z)
= (X + Y +Z) (X + Y + Z) (X + Y + Z) (X + Y + Z) (X + Y + Z) (X + Y + Z)
= (X + Y +Z) (X + Y + Z) (X + Y + Z) (X + Y + Z)
Hence, 
Y = (X + Y +Z) (X + Y + Z) (X + Y + Z) (X + Y + Z) 
is the required canonical POS form representation.

翻译自: https://www.includehelp.com/basics/pos-and-sop-form-representation-of-a-boolean-function.aspx

布尔函数