Sum of products: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
The '''sum of products''' | The '''sum of products''' canonical form of boolean equation is used with truth tables and [[karnaugh map|K maps]] to easily describe and minimize circuits. | ||
= Procedure = | SOP consists of many product terms added together, hence sum of products. It has two levels of logic: literals connect to a level of AND gates, which are then connected to a level of OR gates. | ||
= Procedure with truth table = | |||
First, make a truth table for an output Y. Then, for every row where Y = 1, write out the [[minterm]] of that row. Finally, add all minterms together to form a complete boolean equation for the variable. | First, make a truth table for an output Y. Then, for every row where Y = 1, write out the [[minterm]] of that row. Finally, add all minterms together to form a complete boolean equation for the variable. | ||
[[Category:Computer Architecture]] | [[Category:Computer Architecture]] | ||
[[Category:ECS154A Midterm]] | [[Category:ECS154A Midterm]] | ||
Latest revision as of 22:57, 9 May 2024
The sum of products canonical form of boolean equation is used with truth tables and K maps to easily describe and minimize circuits.
SOP consists of many product terms added together, hence sum of products. It has two levels of logic: literals connect to a level of AND gates, which are then connected to a level of OR gates.
Procedure with truth table
First, make a truth table for an output Y. Then, for every row where Y = 1, write out the minterm of that row. Finally, add all minterms together to form a complete boolean equation for the variable.
