| Boolean functions: sum of products | |||||||||||||
| Canonical form: can represent any truth table using AND, OR, NOT | |||||||||||||
| Sum of products (minterms) | |||||||||||||
| If output is always 0: z = 0 | |||||||||||||
| Product of sums | |||||||||||||
| Look at rows containing 0 | |||||||||||||
| Create maxterms involving sums (OR) of input literals | |||||||||||||
| Use AND to combine the maxterms | |||||||||||||
| Minimization | |||||||||||||
| Techniques are available to: | |||||||||||||
| reduce the number of minterms | |||||||||||||
| reduce the total number of literals | |||||||||||||
| Karnaugh maps: graphical method | |||||||||||||