(Assume a propagation delay of 0.1ns per gate)
|2.22 The minimal POS expression for f(a, b, c, d) = II (0, 2, 4, 6, 8, 9, 12, 13) has two essential prime implicants (a+ d) and (a+ c) and a non-essential prime implicant (c+ d). a. Draw a timing for minimal f= (a + d)(a + c) when its inputs change from acd= 000 to acd = 100. Does the circuit produce a glitch? b. Draw a timing for the non-minimal f = (a+ d) (a + c)(c + d) when its inputs change from acd = 000 to acd = 100, Note f includes all its prime implicants. Is there a 1-hazard?