Consider a logic function with inputs A, B, and C defi ned as follows: ■ If A or C is true, then output D is true, whatever the value of B. ■ If A or B is true, then output E is true, whatever the value of C. ■ Output F is true if exactly one of the inputs is true, although we don’t care about the value of F, whenever D and E are both true. Show the full truth table for this function and the truth table using don’t cares. How many product terms are required in a PLA for each of these?
Consider a logic function with inputs A, B, and C defi ned as follows:
■ If A or C is true, then output D is true, whatever the value of B.
■ If A or B is true, then output E is true, whatever the value of C.
■ Output F is true if exactly one of the inputs is true, although we don’t care about the value of F, whenever D and E are both true.
Show the full truth table for this function and the truth table using don’t cares. How many product terms are required in a PLA for each of these?
Given
1. If A or C is true, then output D is true, whatever the value of B.
2. If A or B is true, then output E is true, whatever the value of C.
3. Output F is true if exactly one of the inputs is true, although we don’t care about the value of F, whenever D and E are both true.
Truth table:
| A | B | C | D | E | F |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 | 1 | 1 |
| 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 |
Step by step
Solved in 2 steps
