Prof. Dr. Thorsten Jungmann (last updated 2026-10-25)
Relates to DET-04 Algorithmic minimization of functions with many inputs and hazard analysis
Task
In a Karnaugh map, each loop of ones that cannot be enlarged is a prime implicant of the function. In each function, the first variable has the highest weight.
a) Draw the Karnaugh map of , and give all its prime implicants. Which of its ones does only a single prime implicant cover? Which prime implicants are essential, and which are redundant? Give the minimal disjunctive normal form (DNF).
b) Answer the same questions for .
c) Draw the Karnaugh map of , and give all its prime implicants and the essential ones among them. Give a minimal DNF. Is it unique?
Solution
a) prime implicants , and ; only one prime implicant covers the ones of minterms 3 and 4; essential: and ; redundant: ;
b) prime implicants , and ; only one prime implicant covers the ones of minterms 5, 7, 10 and 13; essential: and ; redundant: ;
c) prime implicants , , and ; essential: and ; not unique, two minimal DNFs: and
