Prof. Dr. Thorsten Jungmann (last updated 2026-10-19)
Relates to DET-03 Representation and minimization of logic functions
Task
A logic function can be written in several equivalent forms: as a truth table, as a minterm list or a maxterm list, and as a canonical disjunctive normal form (DNF) or a canonical conjunctive normal form (CNF). In this exercise, you switch between these forms. In each function, the first variable has the highest weight, as in the truth tables of the lesson.
a) The function has the following truth table. Give its minterm list, its maxterm list, its canonical DNF and its canonical CNF.
| Row | |||
|---|---|---|---|
| 0 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 2 | 1 | 0 | 1 |
| 3 | 1 | 1 | 1 |
b) Set up the truth table of , and give its canonical DNF.
c) Give the minterm list and the canonical CNF of , and draw the two-level circuit of the canonical CNF.
d) The function has the following truth table. Give its minterm list and its maxterm list. Which of the two canonical normal forms needs fewer gates? Write that normal form down.
| Row | |||||
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 2 | 0 | 0 | 1 | 0 | 1 |
| 3 | 0 | 0 | 1 | 1 | 1 |
| 4 | 0 | 1 | 0 | 0 | 1 |
| 5 | 0 | 1 | 0 | 1 | 1 |
| 6 | 0 | 1 | 1 | 0 | 0 |
| 7 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 0 | 0 | 0 | 1 |
| 9 | 1 | 0 | 0 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 1 |
| 11 | 1 | 0 | 1 | 1 | 0 |
| 12 | 1 | 1 | 0 | 0 | 0 |
| 13 | 1 | 1 | 0 | 1 | 1 |
| 14 | 1 | 1 | 1 | 0 | 1 |
| 15 | 1 | 1 | 1 | 1 | 1 |
Solution
a) ; canonical DNF: ; canonical CNF:
b) a 1 in rows 1, 4 and 6, a 0 in the five other rows;
c) ; ; two OR gates with three inputs, an AND gate with two inputs and inverters for and
d) ; the canonical CNF needs fewer gates, five instead of 13:
