Scribd
Upload
115 views12 pages

Binary Representation of A Standard Product Term

The document discusses product-of-sums (POS) forms in Boolean algebra. It defines a POS form as involving the multiplication of two or more sum terms. It provides examples of POS forms and discusses how a single overbar can extend over multiple variables in a term. The document also discusses how to convert a sum term into a standard POS form by adding missing variables as complements, and how to convert a standard sum-of-products (SOP) expression into an equivalent standard POS expression.

Uploaded by

amury kg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
115 views12 pages

Binary Representation of A Standard Product Term

The document discusses product-of-sums (POS) forms in Boolean algebra. It defines a POS form as involving the multiplication of two or more sum terms. It provides examples of POS forms and discusses how a single overbar can extend over multiple variables in a term. The document also discusses how to convert a sum term into a standard POS form by adding missing variables as complements, and how to convert a standard sum-of-products (SOP) expression into an equivalent standard POS expression.

Uploaded by

amury kg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPSX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Binary Representation of a Standard

Product Term
 A standard product term is equal to 1 for only one
combination of variable values.
 Example: AB CD is equal to 1 when A=1, B=0, C=1,
and D=0 as shown below
AB CD  1  0  1  0  1  1  1  1  1
 And this term is 0 for all other combinations of values
for the variables.
Product-of-Sums (POS)
The Product-of-Sums (POS) Form
 When two or more sum  In a POS form, a single
terms are multiplied, overbar cannot extend
the result expression is over more than one
a product-of-sums variable; however,
(POS): more than one variable
 (Examples:
A  B )( A  B  C ) in a term can have an
( A  B  C )(C  D  E )( B  C  D) overbar:
( A  B )( A  B  C )( A  C )  example: A  B  C is
OK!
A B C
A ( A  B  C )( B  C  D )  But not:
 Also:
Implementation of a POS
X=(A+B)(B+C+D)(A+C)

 OR/AND implementation
A
B

B
C X
D

A
C
The Standard POS Form
 A standard POS expression is one in which all the
variables in the domain appear in each sum term in
the expression.
 Example: ( A  B  C  D )( A  B  C  D)( A  B  C  D)

 Standard POS expressions are important in:


 Constructing truth tables
 The Karnaugh map simplification method
Converting a Sum Term to Standard
POS
 Step 1: Add to each nonstandard product term
a term made up of the product of the missing
variable and its complement. This results in
two sum terms.
 As you know, you can add 0 to anything without
changing its value.
 Step 2: Apply rule 12  A+BC=(A+B)(A+C).
 Step 3: Repeat step 1 until all resulting sum
terms contain all variable in the domain in
either complemented or uncomplemented
form.
Converting a Sum Term to Standard
POS (example)
 Convert the following Boolean expression into
standard POS form:
( A  B  C )( B  C  D )( A  B  C  D)

A  B  C  A  B  C  DD  ( A  B  C  D )( A  B  C  D )

B  C  D  B  C  D  AA  ( A  B  C  D )( A  B  C  D )

( A  B  C )( B  C  D )( A  B  C  D) 
( A  B  C  D)( A  B  C  D )( A  B  C  D )( A  B  C  D )( A  B  C  D)
Binary Representation of a Standard
Sum Term
 A standard sum term is equal to 0 for only one
combination of variable values.
 Example:A  B  C  D is equal to 0 when A=0, B=1, C=0,
and D=1 as shown below
A B C  D  0 1 0 1  0000  0
 And this term is 1 for all other combinations of values
for the variables.
SOP/POS
Converting Standard SOP to
Standard POS
 The Facts:
 The binary values of the product terms in a given
standard SOP expression are not present in the
equivalent standard POS expression.
 The binary values that are not represented in the
SOP expression are present in the equivalent POS
expression.
Converting Standard SOP to
Standard POS
 What can you use the facts?
 Convert from standard SOP to standard POS.
 How?
 Step 1: Evaluate each product term in the SOP
expression. That is, determine the binary numbers
that represent the product terms.
 Step 2: Determine all of the binary numbers not
included in the evaluation in Step 1.
 Step 3: Write the equivalent sum term for each
binary number from Step 2 and express in POS
form.
Converting Standard SOP to
Standard POS (example)
 Convert the SOP expression to an equivalent POS
expression:
A B C  A BC  A BC  AB C  ABC
 The evaluation is as follows:
000  010  011  101  111
 There are 8 possible combinations. The SOP expression
contains five of these, so the POS must contain the other
3 which are: 001, 100, and 110.
( A  B  C )( A  B  C )( A  B  C )

You might also like