[논리설계] 10. SOP, POS Form

1. Boolean Equations

1) Functional specification of outputs in terms of inputs

 

2) some definitions

 

 

2. Sum-of-Products(SOP) Form

1) All equations can be written in SOP form

2) Each row has a minterm

3) A minterm is a product (AND) of literals

4) Each minterm is TRUE for that row (and only that row)

5) Form function by ORing minterms where the output is TRUE

6) Thus, a sum (OR) of products (AND terms)

 

3. Product-of-Sums (POS) Form

1) All Boolean equations can be written in POS form

 

2) Each row has a maxterm

 

3) A maxterm is a sum (OR) of literals

4) Each maxterm is FALSE for that row (and only that row)

5) Form function by ANDing the maxterms for which the output is FALSE

6) Thus, a product (AND) of sums (OR terms)

 

 

📒Exercise

 

4. Boolean Equations Example