Reference no: EM132213889
Question:
Write the simplest Boolean equation for the following Karnaugh Maps:
a) f= M(2,3,8,9,11,12,13,14,15)
b) f=M(0,1,3,5,7,8,9,11,13,15)
c) f= M(0,1,4,5,6,7,10,11,15)
d) f= M(2,3,6,7,8,9,12,13)
Draw the circuitry necessary to implement the following functions in the simples form:
f= m(0,1,7,15).
a) What is the best gate cost that you can find?
b) Convert the result into all-NOR logic.