Question

Use Karnaugh maps to design lowest cost circuits for the following functions with NOT, AND and OR gates. To find the lowest cost, it is a good idea to check both the SOP form of the circuit and POS form of the circuit and compare their cost to find the lowest cost circuit.

(1) f = Σ m(2, 4, 6, 7)

(2) f = Π Μ(2, 4, 5, 6, 7)

(3) f = Σ m(0, 2, 3, 5, 6, 7,8,10,13,15)

(4) f = Π M(0, 2, 5,7,13,14,15) + D(3, 4, 6, 8,10, 11)

(5) f = Σ m(0, 1, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 24, 26, 27, 28, 30, 31)

(Hint: Draw Karnaugh maps for both SOP and POS forms and then obtain the simplified expression by covering 1s (for SOP form) or covering 0s (for POS form). Then design circuits and compare the cost. Circle your lowest cost solution. You should consider two equivalent circuits to compare cost, which means you need to minimize K map for f = SOP (0, 1, 6, 7) - covering 1s, and f = POS (2, 3, 4, 5) - covering 0s)

Answer 1

part 1

part 2

part 3

part 4

Only top 4 subparts will be answered as per rules.