Tables to Expressions
Algorithm:
- For each line of the truth table where the output is T (or 1):
- For each input term:
- If term is T then write term else write not(term)
- Write an AND expression between all these terms in the line to create "product terms"
- OR together all the AND expressions
- STOP
Given inputs A and B with output C:
| A | B | C
| Product Terms
| Sum of Product Terms |
| 0 | 0 | 1
| (~A ~B) |
| 0 | 1 | 0
| | (~A ~B) + (A B) |
| 1 | 0 | 0 |
| 1 | 1 | 1
| (A B) |
Now check the resulting equation:
| A | B | (~A ~B)
| (A B)
| (~A ~B) + (A B) |
| 0
| 0
| 1
| 0
| 1 |
| 0
| 1
| 0
| 0
| 0 |
| 1
| 0
| 0
| 0
| 0 |
| 1
| 1
| 0
| 1
| 1 |
The next step is to design the corresponding circuit.
![[Prev]](prev.gif)
![[TOC]](TOC.gif)
Last updated 2000/02/11
© J.A.N. Lee, 2000.